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/bor1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 21:46:30,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 21:46:30,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 21:46:30,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 21:46:30,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 21:46:30,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 21:46:30,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 21:46:30,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 21:46:30,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 21:46:30,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 21:46:30,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 21:46:30,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 21:46:30,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 21:46:30,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 21:46:30,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 21:46:30,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 21:46:30,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 21:46:30,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 21:46:30,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 21:46:30,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 21:46:30,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 21:46:30,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 21:46:30,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 21:46:30,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 21:46:30,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 21:46:30,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 21:46:30,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 21:46:30,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 21:46:30,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 21:46:30,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 21:46:30,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 21:46:30,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 21:46:30,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 21:46:30,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 21:46:30,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 21:46:30,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 21:46:30,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 21:46:30,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 21:46:30,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 21:46:30,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 21:46:30,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 21:46:30,271 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 21:46:30,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 21:46:30,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 21:46:30,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 21:46:30,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 21:46:30,301 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 21:46:30,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 21:46:30,302 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 21:46:30,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 21:46:30,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 21:46:30,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 21:46:30,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 21:46:30,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 21:46:30,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 21:46:30,304 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 21:46:30,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 21:46:30,305 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 21:46:30,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 21:46:30,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 21:46:30,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 21:46:30,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 21:46:30,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 21:46:30,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 21:46:30,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 21:46:30,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 21:46:30,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 21:46:30,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 21:46:30,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 21:46:30,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 21:46:30,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 21:46:30,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 21:46:30,391 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 21:46:30,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bor1.i [2019-10-01 21:46:30,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3b7d251/4ec702b3113f46d1baf86101b769cc25/FLAGeec9647f3 [2019-10-01 21:46:30,914 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 21:46:30,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor1.i [2019-10-01 21:46:30,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3b7d251/4ec702b3113f46d1baf86101b769cc25/FLAGeec9647f3 [2019-10-01 21:46:31,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3b7d251/4ec702b3113f46d1baf86101b769cc25 [2019-10-01 21:46:31,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 21:46:31,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 21:46:31,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 21:46:31,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 21:46:31,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a810fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31, skipping insertion in model container [2019-10-01 21:46:31,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,314 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 21:46:31,330 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 21:46:31,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,504 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 21:46:31,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,627 INFO L192 MainTranslator]: Completed translation [2019-10-01 21:46:31,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31 WrapperNode [2019-10-01 21:46:31,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 21:46:31,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 21:46:31,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 21:46:31,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 21:46:31,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 21:46:31,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (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 21:46:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 21:46:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 21:46:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2019-10-01 21:46:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 21:46:31,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 21:46:31,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 21:46:31,745 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2019-10-01 21:46:31,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 21:46:31,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 21:46:31,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 21:46:31,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 21:46:31,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 21:46:31,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 21:46:31,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 21:46:32,055 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 21:46:32,055 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 21:46:32,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32 BoogieIcfgContainer [2019-10-01 21:46:32,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 21:46:32,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 21:46:32,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 21:46:32,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 21:46:32,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 09:46:31" (1/3) ... [2019-10-01 21:46:32,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ad9044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (2/3) ... [2019-10-01 21:46:32,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ad9044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:32, skipping insertion in model container [2019-10-01 21:46:32,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:32" (3/3) ... [2019-10-01 21:46:32,079 INFO L109 eAbstractionObserver]: Analyzing ICFG bor1.i [2019-10-01 21:46:32,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 21:46:32,101 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 21:46:32,116 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 21:46:32,142 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 21:46:32,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 21:46:32,143 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 21:46:32,143 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 21:46:32,143 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 21:46:32,144 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 21:46:32,144 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 21:46:32,144 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 21:46:32,144 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 21:46:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 21:46:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,167 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 21:46:32,169 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-10-01 21:46:32,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,335 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 21:46:32,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 21:46:32,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 21:46:32,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 21:46:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:32,358 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 21:46:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,380 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 21:46:32,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 21:46:32,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 21:46:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,390 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:32,390 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 21:46:32,394 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 21:46:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 21:46:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 21:46:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 21:46:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 21:46:32,449 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 21:46:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,450 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 21:46:32,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 21:46:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 21:46:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,456 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 21:46:32,456 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-10-01 21:46:32,457 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,556 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 21:46:32,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:32,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:32,561 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 21:46:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,599 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 21:46:32,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 21:46:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,601 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,601 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 21:46:32,602 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 21:46:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 21:46:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 21:46:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 21:46:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 21:46:32,612 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 21:46:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,612 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 21:46:32,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 21:46:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 21:46:32,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,614 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 21:46:32,615 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-10-01 21:46:32,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,672 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 21:46:32,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:32,673 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 21:46:32,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:32,814 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 21:46:32,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 21:46:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 21:46:32,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 21:46:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 21:46:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:32,828 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 21:46:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,859 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 21:46:32,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 21:46:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,861 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,861 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 21:46:32,862 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 21:46:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 21:46:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 21:46:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 21:46:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 21:46:32,870 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 21:46:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,871 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 21:46:32,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 21:46:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 21:46:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 21:46:32,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,873 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 21:46:32,873 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-10-01 21:46:32,874 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,978 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 21:46:32,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:32,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:32,980 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 21:46:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,996 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 21:46:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 21:46:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,998 INFO L225 Difference]: With dead ends: 43 [2019-10-01 21:46:32,998 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 21:46:32,999 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 21:46:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 21:46:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 21:46:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 21:46:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 21:46:33,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 21:46:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,012 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 21:46:33,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 21:46:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 21:46:33,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,014 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 21:46:33,015 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-10-01 21:46:33,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,103 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 21:46:33,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,104 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 21:46:33,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:33,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 21:46:33,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 21:46:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 21:46:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,224 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 21:46:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,261 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 21:46:33,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 21:46:33,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 21:46:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,276 INFO L225 Difference]: With dead ends: 52 [2019-10-01 21:46:33,276 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 21:46:33,277 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 21:46:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 21:46:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 21:46:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 21:46:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 21:46:33,288 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 21:46:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,289 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 21:46:33,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 21:46:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 21:46:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 21:46:33,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,290 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 21:46:33,291 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-10-01 21:46:33,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,375 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 21:46:33,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,376 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:33,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:33,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,475 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 21:46:33,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 21:46:33,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 21:46:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 21:46:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:33,481 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 21:46:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,515 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 21:46:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 21:46:33,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 21:46:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,516 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:33,517 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 21:46:33,517 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 21:46:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 21:46:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 21:46:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 21:46:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 21:46:33,524 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 21:46:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,524 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 21:46:33,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 21:46:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 21:46:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 21:46:33,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,526 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 21:46:33,527 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2019-10-01 21:46:33,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,617 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 21:46:33,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,617 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:33,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 21:46:33,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,713 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 21:46:33,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 21:46:33,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:33,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:33,720 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 21:46:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,769 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 21:46:33,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 21:46:33,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 21:46:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,772 INFO L225 Difference]: With dead ends: 59 [2019-10-01 21:46:33,772 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 21:46:33,773 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 21:46:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 21:46:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 21:46:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 21:46:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 21:46:33,779 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 21:46:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,780 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 21:46:33,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 21:46:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 21:46:33,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,781 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 21:46:33,782 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2019-10-01 21:46:33,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,886 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 21:46:33,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,887 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 21:46:33,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:33,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:33,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,001 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 21:46:34,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 21:46:34,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:34,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,007 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 21:46:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,048 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 21:46:34,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 21:46:34,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 21:46:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,049 INFO L225 Difference]: With dead ends: 62 [2019-10-01 21:46:34,050 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 21:46:34,050 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 21:46:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 21:46:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 21:46:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 21:46:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 21:46:34,056 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 21:46:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,056 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 21:46:34,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 21:46:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 21:46:34,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,058 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 21:46:34,058 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2019-10-01 21:46:34,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,163 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 21:46:34,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,164 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:34,248 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 21:46:34,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:34,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 21:46:34,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,324 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 21:46:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,388 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 21:46:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 21:46:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,393 INFO L225 Difference]: With dead ends: 67 [2019-10-01 21:46:34,393 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 21:46:34,396 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 21:46:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 21:46:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 21:46:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 21:46:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 21:46:34,403 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 21:46:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,403 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 21:46:34,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 21:46:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 21:46:34,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,405 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 21:46:34,405 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2019-10-01 21:46:34,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,508 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 21:46:34,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,509 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:34,533 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,578 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 21:46:34,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,611 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 21:46:34,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 21:46:34,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,617 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 21:46:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,682 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 21:46:34,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 21:46:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,684 INFO L225 Difference]: With dead ends: 73 [2019-10-01 21:46:34,684 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 21:46:34,685 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 21:46:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 21:46:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 21:46:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 21:46:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 21:46:34,699 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 21:46:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,699 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 21:46:34,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 21:46:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 21:46:34,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,701 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 21:46:34,701 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2019-10-01 21:46:34,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,862 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 21:46:34,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,863 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 21:46:34,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,949 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 21:46:34,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 21:46:34,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,963 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 21:46:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,025 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 21:46:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 21:46:35,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 21:46:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,027 INFO L225 Difference]: With dead ends: 76 [2019-10-01 21:46:35,027 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 21:46:35,029 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 21:46:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 21:46:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 21:46:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 21:46:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 21:46:35,045 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 21:46:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,045 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 21:46:35,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 21:46:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 21:46:35,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,048 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 21:46:35,049 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2019-10-01 21:46:35,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,208 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 21:46:35,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,209 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 21:46:35,236 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 21:46:35,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:35,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,315 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 21:46:35,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 21:46:35,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 21:46:35,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 21:46:35,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:35,321 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 21:46:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,381 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 21:46:35,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:35,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 21:46:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,383 INFO L225 Difference]: With dead ends: 78 [2019-10-01 21:46:35,383 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 21:46:35,384 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 21:46:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 21:46:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 21:46:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 21:46:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 21:46:35,398 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 21:46:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,399 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 21:46:35,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 21:46:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 21:46:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 21:46:35,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,404 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 21:46:35,404 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2019-10-01 21:46:35,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,550 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 21:46:35,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,550 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 21:46:35,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:35,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 21:46:35,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:35,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 21:46:35,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 21:46:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 21:46:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:35,669 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 21:46:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,744 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 21:46:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 21:46:35,745 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 21:46:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,746 INFO L225 Difference]: With dead ends: 83 [2019-10-01 21:46:35,746 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 21:46:35,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 21:46:35,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 21:46:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 21:46:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 21:46:35,763 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 21:46:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,763 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 21:46:35,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 21:46:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 21:46:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 21:46:35,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,767 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 21:46:35,768 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2019-10-01 21:46:35,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,928 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 21:46:35,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,929 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 21:46:35,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:35,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:35,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,046 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 21:46:36,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 21:46:36,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:36,052 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 21:46:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,125 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 21:46:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:36,125 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 21:46:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,126 INFO L225 Difference]: With dead ends: 89 [2019-10-01 21:46:36,126 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 21:46:36,127 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 21:46:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 21:46:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 21:46:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 21:46:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 21:46:36,133 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 21:46:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,134 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 21:46:36,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 21:46:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 21:46:36,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,135 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 21:46:36,135 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2019-10-01 21:46:36,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,281 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 21:46:36,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,283 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:36,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:36,431 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 21:46:36,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,497 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 21:46:36,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 21:46:36,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:36,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:36,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,503 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 21:46:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,578 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 21:46:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:36,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 21:46:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,579 INFO L225 Difference]: With dead ends: 95 [2019-10-01 21:46:36,580 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 21:46:36,580 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 21:46:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 21:46:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 21:46:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 21:46:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 21:46:36,586 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 21:46:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,586 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 21:46:36,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 21:46:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 21:46:36,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,588 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 21:46:36,588 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2019-10-01 21:46:36,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,740 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 21:46:36,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,740 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:36,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:36,987 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 21:46:36,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,060 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 21:46:37,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 21:46:37,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:37,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:37,069 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 21:46:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,173 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 21:46:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:37,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 21:46:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,175 INFO L225 Difference]: With dead ends: 101 [2019-10-01 21:46:37,175 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 21:46:37,176 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 21:46:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 21:46:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 21:46:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 21:46:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 21:46:37,182 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 21:46:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,182 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 21:46:37,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 21:46:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 21:46:37,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,184 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 21:46:37,184 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2019-10-01 21:46:37,184 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,346 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 21:46:37,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,347 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 21:46:37,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:37,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 21:46:37,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:37,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:37,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:37,490 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 21:46:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,581 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 21:46:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 21:46:37,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 21:46:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,582 INFO L225 Difference]: With dead ends: 104 [2019-10-01 21:46:37,583 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 21:46:37,584 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 21:46:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 21:46:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 21:46:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 21:46:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 21:46:37,590 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 21:46:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,591 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 21:46:37,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 21:46:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 21:46:37,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,596 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 21:46:37,596 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2019-10-01 21:46:37,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,846 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 21:46:37,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,846 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 21:46:37,883 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 21:46:37,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:37,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:37,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,963 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 21:46:37,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 21:46:37,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 21:46:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 21:46:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:37,975 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 21:46:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,034 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 21:46:38,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:38,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 21:46:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,036 INFO L225 Difference]: With dead ends: 106 [2019-10-01 21:46:38,036 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 21:46:38,037 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 21:46:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 21:46:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 21:46:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 21:46:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 21:46:38,045 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 21:46:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,045 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 21:46:38,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 21:46:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 21:46:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 21:46:38,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,047 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 21:46:38,047 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2019-10-01 21:46:38,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,249 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 21:46:38,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,250 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) [2019-10-01 21:46:38,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 21:46:38,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,431 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 21:46:38,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 21:46:38,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:38,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:38,438 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 21:46:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,549 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 21:46:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 21:46:38,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 21:46:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,550 INFO L225 Difference]: With dead ends: 111 [2019-10-01 21:46:38,550 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 21:46:38,551 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 21:46:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 21:46:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 21:46:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 21:46:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 21:46:38,556 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 21:46:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,556 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 21:46:38,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 21:46:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 21:46:38,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,557 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 21:46:38,558 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2019-10-01 21:46:38,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,806 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 21:46:38,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,807 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:38,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:38,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,944 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 21:46:38,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 21:46:38,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 21:46:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 21:46:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:38,950 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 21:46:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,020 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 21:46:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:39,021 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 21:46:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,022 INFO L225 Difference]: With dead ends: 114 [2019-10-01 21:46:39,022 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 21:46:39,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 21:46:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 21:46:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 21:46:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 21:46:39,027 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 21:46:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,027 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 21:46:39,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 21:46:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 21:46:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 21:46:39,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,029 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 21:46:39,029 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2019-10-01 21:46:39,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,257 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 21:46:39,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,257 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:46:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:39,837 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 21:46:39,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:39,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,985 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 21:46:39,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:39,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 21:46:39,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 21:46:39,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 21:46:39,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:39,997 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 21:46:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,099 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 21:46:40,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 21:46:40,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 21:46:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,102 INFO L225 Difference]: With dead ends: 119 [2019-10-01 21:46:40,102 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 21:46:40,102 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 21:46:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 21:46:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 21:46:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 21:46:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 21:46:40,107 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 21:46:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,107 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 21:46:40,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 21:46:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 21:46:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 21:46:40,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,109 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 21:46:40,109 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2019-10-01 21:46:40,110 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,382 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 21:46:40,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,382 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 21:46:40,418 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:40,791 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 21:46:40,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:40,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:40,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 21:46:40,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 21:46:40,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:40,875 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 21:46:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,000 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 21:46:41,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 21:46:41,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 21:46:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,002 INFO L225 Difference]: With dead ends: 125 [2019-10-01 21:46:41,002 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 21:46:41,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 21:46:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 21:46:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 21:46:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 21:46:41,007 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 21:46:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,007 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 21:46:41,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 21:46:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 21:46:41,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,009 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 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 21:46:41,009 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2019-10-01 21:46:41,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,275 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 21:46:41,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 21:46:41,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 21:46:41,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 21:46:41,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:41,397 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 21:46:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,463 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 21:46:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 21:46:41,463 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 21:46:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,464 INFO L225 Difference]: With dead ends: 128 [2019-10-01 21:46:41,464 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 21:46:41,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 21:46:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 21:46:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 21:46:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 21:46:41,469 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 21:46:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,469 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 21:46:41,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 21:46:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 21:46:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 21:46:41,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,470 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 21:46:41,471 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2019-10-01 21:46:41,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,772 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 21:46:41,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,772 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:46:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:41,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:41,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:41,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,923 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 21:46:41,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 21:46:41,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:41,929 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 21:46:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,996 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 21:46:41,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 21:46:41,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 21:46:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,998 INFO L225 Difference]: With dead ends: 130 [2019-10-01 21:46:41,998 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 21:46:41,999 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 21:46:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 21:46:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 21:46:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 21:46:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 21:46:42,004 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 21:46:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,005 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 21:46:42,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 21:46:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 21:46:42,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,007 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 21:46:42,007 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2019-10-01 21:46:42,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,349 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 21:46:42,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,350 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 21:46:42,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:42,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 21:46:42,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:42,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-01 21:46:42,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 21:46:42,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:42,599 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 21:46:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,745 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 21:46:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 21:46:42,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 21:46:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,750 INFO L225 Difference]: With dead ends: 135 [2019-10-01 21:46:42,751 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 21:46:42,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 21:46:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 21:46:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 21:46:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 21:46:42,756 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 21:46:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,756 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 21:46:42,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 21:46:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 21:46:42,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,757 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 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 21:46:42,758 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2019-10-01 21:46:42,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,115 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 21:46:43,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:43,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:43,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 21:46:43,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:43,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:43,255 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 21:46:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,339 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 21:46:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 21:46:43,341 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 21:46:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,342 INFO L225 Difference]: With dead ends: 138 [2019-10-01 21:46:43,342 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 21:46:43,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 21:46:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 21:46:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 21:46:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 21:46:43,350 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 21:46:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:43,350 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 21:46:43,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 21:46:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 21:46:43,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:43,352 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 21:46:43,352 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2019-10-01 21:46:43,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:43,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:43,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,688 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 21:46:43,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,688 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 21:46:43,718 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:45,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 21:46:45,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:45,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:45,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-01 21:46:46,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:46,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 21:46:46,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 21:46:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 21:46:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:46,196 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-01 21:46:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:46,384 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 21:46:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:46,384 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-01 21:46:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:46,386 INFO L225 Difference]: With dead ends: 143 [2019-10-01 21:46:46,386 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 21:46:46,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 21:46:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 21:46:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 21:46:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 21:46:46,394 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 21:46:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:46,394 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 21:46:46,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 21:46:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 21:46:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 21:46:46,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:46,398 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 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 21:46:46,398 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:46,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2019-10-01 21:46:46,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:46,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:46,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:46,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 21:46:46,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:46,891 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 21:46:46,932 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:47,670 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 21:46:47,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:47,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:47,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-10-01 21:46:47,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:47,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-01 21:46:47,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 21:46:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 21:46:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:47,807 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-01 21:46:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,936 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-01 21:46:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:47,939 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-01 21:46:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,940 INFO L225 Difference]: With dead ends: 149 [2019-10-01 21:46:47,940 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 21:46:47,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 21:46:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-01 21:46:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 21:46:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-01 21:46:47,945 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-01 21:46:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,945 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-01 21:46:47,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 21:46:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-01 21:46:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 21:46:47,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,947 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 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 21:46:47,947 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2019-10-01 21:46:47,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:48,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:48,432 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 21:46:48,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:48,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 21:46:48,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 21:46:48,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 21:46:48,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 21:46:48,565 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-01 21:46:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:48,698 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 21:46:48,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 21:46:48,699 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-01 21:46:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:48,700 INFO L225 Difference]: With dead ends: 152 [2019-10-01 21:46:48,700 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 21:46:48,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 21:46:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 21:46:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 21:46:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 21:46:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 21:46:48,706 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-01 21:46:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:48,706 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 21:46:48,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 21:46:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 21:46:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 21:46:48,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:48,708 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 21:46:48,708 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2019-10-01 21:46:48,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:48,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:49,089 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 21:46:49,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:49,089 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 21:46:49,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:49,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:49,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:49,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:46:49,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:49,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 21:46:49,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:49,237 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 21:46:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:49,327 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 21:46:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 21:46:49,328 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 21:46:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:49,329 INFO L225 Difference]: With dead ends: 154 [2019-10-01 21:46:49,329 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 21:46:49,330 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 21:46:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 21:46:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 21:46:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 21:46:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 21:46:49,336 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 21:46:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:49,337 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 21:46:49,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 21:46:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 21:46:49,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:49,338 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 21:46:49,338 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:49,339 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2019-10-01 21:46:49,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:49,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:49,765 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 21:46:49,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:49,765 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:46:49,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:50,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 21:46:50,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:50,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:50,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2019-10-01 21:46:50,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:50,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-01 21:46:50,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 21:46:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 21:46:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:50,212 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-01 21:46:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:50,393 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-01 21:46:50,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 21:46:50,394 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-01 21:46:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:50,394 INFO L225 Difference]: With dead ends: 159 [2019-10-01 21:46:50,394 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 21:46:50,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 21:46:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-01 21:46:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 21:46:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-01 21:46:50,403 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-01 21:46:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:50,403 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-01 21:46:50,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 21:46:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-01 21:46:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 21:46:50,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:50,405 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 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 21:46:50,405 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2019-10-01 21:46:50,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:50,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 21:46:50,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:50,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 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 21:46:50,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:51,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:51,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:51,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:51,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-01 21:46:51,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:51,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-01 21:46:51,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 21:46:51,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 21:46:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:51,321 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-01 21:46:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:51,490 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-01 21:46:51,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:46:51,491 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-01 21:46:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:51,492 INFO L225 Difference]: With dead ends: 165 [2019-10-01 21:46:51,492 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 21:46:51,495 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 21:46:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 21:46:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 21:46:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-01 21:46:51,505 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-01 21:46:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:51,505 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-01 21:46:51,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 21:46:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-01 21:46:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 21:46:51,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:51,507 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 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 21:46:51,507 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:51,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2019-10-01 21:46:51,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:51,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:51,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 21:46:52,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:52,195 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:46:52,263 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:47:03,236 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 21:47:03,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:03,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:47:03,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-01 21:47:03,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:03,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 21:47:03,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:03,535 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-01 21:47:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:03,779 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-01 21:47:03,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:03,779 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-01 21:47:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:03,780 INFO L225 Difference]: With dead ends: 171 [2019-10-01 21:47:03,781 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 21:47:03,782 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 21:47:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-01 21:47:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 21:47:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-01 21:47:03,790 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-01 21:47:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:03,790 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-01 21:47:03,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-01 21:47:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 21:47:03,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:03,792 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 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 21:47:03,792 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2019-10-01 21:47:03,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:03,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:03,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 21:47:04,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:04,276 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:47:04,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:47:07,701 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 21:47:07,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:07,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:47:07,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-01 21:47:07,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:07,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-01 21:47:07,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:07,942 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-01 21:47:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:08,140 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-01 21:47:08,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:08,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-01 21:47:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:08,142 INFO L225 Difference]: With dead ends: 177 [2019-10-01 21:47:08,142 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 21:47:08,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 21:47:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-01 21:47:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 21:47:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 21:47:08,149 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-01 21:47:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:08,149 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 21:47:08,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 21:47:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 21:47:08,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:08,151 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 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 21:47:08,151 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2019-10-01 21:47:08,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:08,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:08,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:08,944 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 21:47:08,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:09,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 21:47:09,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:09,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:09,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 21:47:09,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 21:47:09,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 21:47:09,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:47:09,101 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-01 21:47:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:09,202 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-01 21:47:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:47:09,203 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-01 21:47:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:09,204 INFO L225 Difference]: With dead ends: 180 [2019-10-01 21:47:09,204 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 21:47:09,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:47:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 21:47:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 21:47:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 21:47:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 21:47:09,213 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-01 21:47:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:09,213 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 21:47:09,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 21:47:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 21:47:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 21:47:09,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:09,215 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 21:47:09,215 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2019-10-01 21:47:09,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:09,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:09,796 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 21:47:09,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:09,796 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:47:09,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:09,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:09,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:09,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 21:47:09,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:09,970 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 21:47:09,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:09,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 21:47:09,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 21:47:09,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 21:47:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:09,976 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 21:47:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:10,083 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 21:47:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:47:10,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 21:47:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:10,085 INFO L225 Difference]: With dead ends: 182 [2019-10-01 21:47:10,085 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 21:47:10,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 21:47:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 21:47:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 21:47:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 21:47:10,091 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 21:47:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:10,092 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 21:47:10,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 21:47:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 21:47:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 21:47:10,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:10,093 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 21:47:10,093 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2019-10-01 21:47:10,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:10,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:10,614 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 21:47:10,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:10,615 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 21:47:10,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:10,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 21:47:10,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:10,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:47:10,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:11,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:11,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-01 21:47:11,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 21:47:11,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 21:47:11,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:11,130 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-01 21:47:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:11,327 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-01 21:47:11,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 21:47:11,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-01 21:47:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:11,328 INFO L225 Difference]: With dead ends: 187 [2019-10-01 21:47:11,328 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 21:47:11,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 21:47:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-01 21:47:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 21:47:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-01 21:47:11,335 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-01 21:47:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:11,335 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-01 21:47:11,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 21:47:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-01 21:47:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 21:47:11,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:11,337 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 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 21:47:11,337 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2019-10-01 21:47:11,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:11,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:11,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:11,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:11,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-10-01 21:47:11,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:11,908 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 21:47:11,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:12,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:12,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:12,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:12,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-01 21:47:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:12,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 21:47:12,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:47:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:47:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:12,300 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-01 21:47:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:12,547 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-01 21:47:12,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:47:12,548 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-01 21:47:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:12,549 INFO L225 Difference]: With dead ends: 193 [2019-10-01 21:47:12,549 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 21:47:12,550 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 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 21:47:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 21:47:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 21:47:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 21:47:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-01 21:47:12,555 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-01 21:47:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:12,555 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-01 21:47:12,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:47:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-01 21:47:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 21:47:12,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:12,557 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 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 21:47:12,557 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:12,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2019-10-01 21:47:12,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:12,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:12,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:12,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:12,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-10-01 21:47:13,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:13,190 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 21:47:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:48:05,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 21:48:05,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:06,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:48:06,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-10-01 21:48:06,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:06,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-01 21:48:06,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 21:48:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 21:48:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:48:06,316 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-01 21:48:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:06,515 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-01 21:48:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 21:48:06,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-01 21:48:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:06,518 INFO L225 Difference]: With dead ends: 199 [2019-10-01 21:48:06,518 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 21:48:06,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:48:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 21:48:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-01 21:48:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 21:48:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-01 21:48:06,524 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-01 21:48:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:06,524 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-01 21:48:06,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 21:48:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-01 21:48:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 21:48:06,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:06,526 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 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 21:48:06,526 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2019-10-01 21:48:06,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:06,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-10-01 21:48:07,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:07,393 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 21:48:07,448 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:48:17,029 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 21:48:17,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:17,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:48:17,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-10-01 21:48:17,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:17,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 21:48:17,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 21:48:17,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 21:48:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:48:17,303 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-01 21:48:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:17,531 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-01 21:48:17,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 21:48:17,531 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-01 21:48:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:17,532 INFO L225 Difference]: With dead ends: 205 [2019-10-01 21:48:17,532 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 21:48:17,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:48:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 21:48:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-01 21:48:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 21:48:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-01 21:48:17,539 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-01 21:48:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:17,539 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-01 21:48:17,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 21:48:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-01 21:48:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 21:48:17,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:17,541 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 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 21:48:17,541 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2019-10-01 21:48:17,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:17,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:17,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:18,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:18,336 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:48:18,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:18,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 21:48:18,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:18,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:18,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 21:48:18,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 21:48:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 21:48:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:48:18,675 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-01 21:48:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:18,849 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-01 21:48:18,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:48:18,850 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-01 21:48:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:18,852 INFO L225 Difference]: With dead ends: 208 [2019-10-01 21:48:18,852 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 21:48:18,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:48:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 21:48:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 21:48:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 21:48:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 21:48:18,863 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-01 21:48:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:18,864 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 21:48:18,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 21:48:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 21:48:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 21:48:18,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:18,867 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 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 21:48:18,868 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:18,868 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2019-10-01 21:48:18,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:18,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:18,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:19,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:19,659 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 21:48:19,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:48:19,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:48:19,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:19,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 21:48:19,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:19,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:19,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 21:48:19,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:48:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:48:19,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:48:19,895 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 21:48:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:20,043 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 21:48:20,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:48:20,044 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-01 21:48:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:20,045 INFO L225 Difference]: With dead ends: 210 [2019-10-01 21:48:20,045 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 21:48:20,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:48:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 21:48:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 21:48:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 21:48:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 21:48:20,051 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-01 21:48:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:20,051 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 21:48:20,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:48:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 21:48:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 21:48:20,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:20,053 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 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 21:48:20,053 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2019-10-01 21:48:20,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:20,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:20,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:20,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:20,900 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:48:20,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:48:21,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 21:48:21,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:21,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:48:21,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2019-10-01 21:48:21,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:21,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 21:48:21,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 21:48:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 21:48:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:48:21,658 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-01 21:48:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:21,883 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2019-10-01 21:48:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 21:48:21,886 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-01 21:48:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:21,888 INFO L225 Difference]: With dead ends: 215 [2019-10-01 21:48:21,888 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 21:48:21,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:48:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 21:48:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-01 21:48:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 21:48:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-01 21:48:21,898 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-01 21:48:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:21,899 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-01 21:48:21,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 21:48:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-01 21:48:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 21:48:21,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:21,901 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 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 21:48:21,901 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2019-10-01 21:48:21,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:21,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:21,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:21,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:21,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:48:22,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:22,636 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 21:48:22,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:48:22,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:48:22,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:22,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 21:48:22,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:48:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:22,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 21:48:22,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 21:48:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 21:48:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:48:22,868 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2019-10-01 21:48:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:22,995 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2019-10-01 21:48:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:48:22,996 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2019-10-01 21:48:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:22,997 INFO L225 Difference]: With dead ends: 218 [2019-10-01 21:48:22,997 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 21:48:22,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:48:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 21:48:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-01 21:48:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 21:48:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 21:48:23,003 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-01 21:48:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:23,004 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 21:48:23,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 21:48:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 21:48:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 21:48:23,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:23,005 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 21:48:23,006 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2019-10-01 21:48:23,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:23,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:23,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:23,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:23,879 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 21:48:23,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:23,880 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 21:48:23,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:49:33,846 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 21:49:33,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:33,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:49:33,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2515 trivial. 0 not checked. [2019-10-01 21:49:34,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:34,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 16] total 58 [2019-10-01 21:49:34,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 21:49:34,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 21:49:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:49:34,231 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 58 states. [2019-10-01 21:49:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:34,463 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2019-10-01 21:49:34,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:49:34,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-10-01 21:49:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:34,465 INFO L225 Difference]: With dead ends: 223 [2019-10-01 21:49:34,465 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 21:49:34,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:49:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 21:49:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 21:49:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 21:49:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-01 21:49:34,472 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 214 [2019-10-01 21:49:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:34,472 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-01 21:49:34,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 21:49:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-01 21:49:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 21:49:34,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:34,474 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 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 21:49:34,475 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:34,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:34,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1200258067, now seen corresponding path program 42 times [2019-10-01 21:49:34,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:34,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:34,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:34,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 21:49:35,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:35,387 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 21:49:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:49:40,608 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 21:49:40,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:40,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:49:40,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2777 trivial. 0 not checked. [2019-10-01 21:49:40,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:40,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 14] total 57 [2019-10-01 21:49:40,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 21:49:40,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 21:49:40,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:49:40,934 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 57 states. [2019-10-01 21:49:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:41,137 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2019-10-01 21:49:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 21:49:41,138 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2019-10-01 21:49:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:41,139 INFO L225 Difference]: With dead ends: 229 [2019-10-01 21:49:41,139 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 21:49:41,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:49:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 21:49:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-01 21:49:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 21:49:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-01 21:49:41,145 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 222 [2019-10-01 21:49:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:41,146 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-01 21:49:41,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 21:49:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-01 21:49:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-01 21:49:41,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:41,148 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 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 21:49:41,148 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash 320829261, now seen corresponding path program 43 times [2019-10-01 21:49:41,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:41,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:41,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:41,971 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:49:42,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:49:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:42,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 21:49:42,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:42,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:42,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 21:49:42,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 21:49:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 21:49:42,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 21:49:42,192 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 47 states. [2019-10-01 21:49:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:42,350 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2019-10-01 21:49:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 21:49:42,354 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 226 [2019-10-01 21:49:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:42,356 INFO L225 Difference]: With dead ends: 232 [2019-10-01 21:49:42,356 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 21:49:42,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 21:49:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 21:49:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-01 21:49:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 21:49:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 21:49:42,362 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 226 [2019-10-01 21:49:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:42,363 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 21:49:42,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 21:49:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 21:49:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 21:49:42,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:42,365 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 21:49:42,365 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1514417361, now seen corresponding path program 44 times [2019-10-01 21:49:42,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:42,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:49:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:43,643 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 21:49:43,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:43,644 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:49:43,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:49:43,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:49:43,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:43,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 21:49:43,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:49:43,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:43,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 21:49:43,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:49:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:49:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:49:43,881 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 21:49:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:44,058 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 21:49:44,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 21:49:44,059 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 21:49:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:44,060 INFO L225 Difference]: With dead ends: 234 [2019-10-01 21:49:44,060 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 21:49:44,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:49:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 21:49:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 21:49:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 21:49:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 21:49:44,072 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 21:49:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:44,072 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 21:49:44,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:49:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 21:49:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 21:49:44,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:44,074 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 21:49:44,074 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash 45137553, now seen corresponding path program 45 times [2019-10-01 21:49:44,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:44,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:45,014 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 21:49:45,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:45,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 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 21:49:45,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:49:45,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 21:49:45,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:45,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:49:45,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [2019-10-01 21:49:45,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:45,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 15] total 61 [2019-10-01 21:49:45,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 21:49:45,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 21:49:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:49:45,883 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 61 states. [2019-10-01 21:49:46,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:46,190 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2019-10-01 21:49:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 21:49:46,193 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 230 [2019-10-01 21:49:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:46,194 INFO L225 Difference]: With dead ends: 239 [2019-10-01 21:49:46,194 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 21:49:46,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:49:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 21:49:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-10-01 21:49:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 21:49:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-10-01 21:49:46,201 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 230 [2019-10-01 21:49:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:46,201 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-10-01 21:49:46,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 21:49:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-10-01 21:49:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-01 21:49:46,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:46,203 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 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 21:49:46,203 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:46,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1593644785, now seen corresponding path program 46 times [2019-10-01 21:49:46,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:46,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:46,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:49:47,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:47,370 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:49:47,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:49:47,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:49:47,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:47,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 21:49:47,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:49:47,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:47,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 21:49:47,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 21:49:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 21:49:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:49:47,597 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 50 states. [2019-10-01 21:49:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:47,757 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 21:49:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 21:49:47,758 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 234 [2019-10-01 21:49:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:47,759 INFO L225 Difference]: With dead ends: 242 [2019-10-01 21:49:47,759 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 21:49:47,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:49:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 21:49:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 21:49:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 21:49:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 21:49:47,766 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 234 [2019-10-01 21:49:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:47,766 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 21:49:47,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 21:49:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 21:49:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 21:49:47,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:47,768 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 21:49:47,768 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash -847744813, now seen corresponding path program 47 times [2019-10-01 21:49:47,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:47,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:47,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:47,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:49,036 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 21:49:49,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:49,036 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:49:49,117 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:51:52,109 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 21:51:52,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:52,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:51:52,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3201 trivial. 0 not checked. [2019-10-01 21:51:52,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:52,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 17] total 65 [2019-10-01 21:51:52,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 21:51:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 21:51:52,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:51:52,591 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 65 states. [2019-10-01 21:51:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:52,815 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2019-10-01 21:51:52,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 21:51:52,816 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 236 [2019-10-01 21:51:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:52,818 INFO L225 Difference]: With dead ends: 247 [2019-10-01 21:51:52,818 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 21:51:52,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:51:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 21:51:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-10-01 21:51:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-01 21:51:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2019-10-01 21:51:52,824 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 236 [2019-10-01 21:51:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:52,824 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2019-10-01 21:51:52,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 21:51:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2019-10-01 21:51:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-01 21:51:52,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:52,826 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 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 21:51:52,827 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash -96970445, now seen corresponding path program 48 times [2019-10-01 21:51:52,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:52,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:52,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:52,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:52,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 21:51:53,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:53,853 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 21:51:53,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:52:01,569 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 21:52:01,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:01,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:52:01,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:52:02,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:02,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 16] total 65 [2019-10-01 21:52:02,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 21:52:02,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 21:52:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:52:02,156 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 65 states. [2019-10-01 21:52:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:02,501 INFO L93 Difference]: Finished difference Result 253 states and 262 transitions. [2019-10-01 21:52:02,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 21:52:02,502 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 244 [2019-10-01 21:52:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:02,503 INFO L225 Difference]: With dead ends: 253 [2019-10-01 21:52:02,503 INFO L226 Difference]: Without dead ends: 181 [2019-10-01 21:52:02,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:52:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-01 21:52:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-10-01 21:52:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-01 21:52:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-10-01 21:52:02,510 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 244 [2019-10-01 21:52:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:02,510 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-10-01 21:52:02,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 21:52:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-10-01 21:52:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-01 21:52:02,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:02,512 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 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 21:52:02,512 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1392071277, now seen corresponding path program 49 times [2019-10-01 21:52:02,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:02,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:03,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:03,582 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 21:52:03,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:52:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:03,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 21:52:03,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 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 21:52:03,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:03,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 21:52:03,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 21:52:03,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 21:52:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 21:52:03,844 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 53 states. [2019-10-01 21:52:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:04,008 INFO L93 Difference]: Finished difference Result 256 states and 264 transitions. [2019-10-01 21:52:04,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 21:52:04,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 248 [2019-10-01 21:52:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:04,010 INFO L225 Difference]: With dead ends: 256 [2019-10-01 21:52:04,010 INFO L226 Difference]: Without dead ends: 182 [2019-10-01 21:52:04,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 21:52:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-01 21:52:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-10-01 21:52:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 21:52:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 21:52:04,016 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 248 [2019-10-01 21:52:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:04,016 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 21:52:04,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 21:52:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 21:52:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 21:52:04,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:04,018 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 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 21:52:04,019 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:04,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1139151861, now seen corresponding path program 50 times [2019-10-01 21:52:04,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:04,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:04,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:52:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:05,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:05,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 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 21:52:05,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:52:05,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:52:05,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:05,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 21:52:05,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (52)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:52:05,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:05,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 21:52:05,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:52:05,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:52:05,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:52:05,424 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 21:52:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:05,684 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 21:52:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 21:52:05,684 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 21:52:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:05,686 INFO L225 Difference]: With dead ends: 258 [2019-10-01 21:52:05,686 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 21:52:05,686 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:52:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 21:52:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 21:52:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 21:52:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 21:52:05,691 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 21:52:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:05,692 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 21:52:05,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:52:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 21:52:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 21:52:05,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:05,694 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 21:52:05,695 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1601869353, now seen corresponding path program 51 times [2019-10-01 21:52:05,695 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:05,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:05,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:05,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:06,827 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 21:52:06,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:06,828 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 21:52:06,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:52:07,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 21:52:07,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:07,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:52:07,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3761 trivial. 0 not checked. [2019-10-01 21:52:08,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:08,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 17] total 69 [2019-10-01 21:52:08,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 21:52:08,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 21:52:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 21:52:08,281 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 69 states. [2019-10-01 21:52:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:08,637 INFO L93 Difference]: Finished difference Result 263 states and 272 transitions. [2019-10-01 21:52:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-01 21:52:08,638 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 252 [2019-10-01 21:52:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:08,639 INFO L225 Difference]: With dead ends: 263 [2019-10-01 21:52:08,639 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 21:52:08,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 21:52:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 21:52:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2019-10-01 21:52:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 21:52:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-10-01 21:52:08,645 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 252 [2019-10-01 21:52:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:08,645 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-10-01 21:52:08,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 21:52:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-10-01 21:52:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-01 21:52:08,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:08,647 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 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 21:52:08,647 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash -121232585, now seen corresponding path program 52 times [2019-10-01 21:52:08,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:08,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:08,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:52:09,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:09,823 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 21:52:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:52:10,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:52:10,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:10,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 21:52:10,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:52:10,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:10,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 21:52:10,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 21:52:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 21:52:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 21:52:10,093 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 56 states. [2019-10-01 21:52:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:10,308 INFO L93 Difference]: Finished difference Result 266 states and 274 transitions. [2019-10-01 21:52:10,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 21:52:10,309 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 256 [2019-10-01 21:52:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:10,310 INFO L225 Difference]: With dead ends: 266 [2019-10-01 21:52:10,310 INFO L226 Difference]: Without dead ends: 190 [2019-10-01 21:52:10,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 21:52:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-01 21:52:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-10-01 21:52:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 21:52:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 21:52:10,318 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 256 [2019-10-01 21:52:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:10,318 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 21:52:10,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 21:52:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 21:52:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 21:52:10,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:10,320 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 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 21:52:10,320 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:10,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1192363929, now seen corresponding path program 53 times [2019-10-01 21:52:10,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:10,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:10,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:10,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:52:11,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:11,613 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:52:11,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:53:45,995 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 21:53:45,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:53:46,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:53:46,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:53:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 3975 trivial. 0 not checked. [2019-10-01 21:53:46,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:53:46,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 18] total 72 [2019-10-01 21:53:46,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-01 21:53:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-01 21:53:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 21:53:46,525 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 72 states. [2019-10-01 21:53:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:53:46,904 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2019-10-01 21:53:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 21:53:46,905 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 258 [2019-10-01 21:53:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:53:46,907 INFO L225 Difference]: With dead ends: 271 [2019-10-01 21:53:46,907 INFO L226 Difference]: Without dead ends: 195 [2019-10-01 21:53:46,908 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 21:53:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-01 21:53:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-10-01 21:53:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-01 21:53:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 197 transitions. [2019-10-01 21:53:46,913 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 197 transitions. Word has length 258 [2019-10-01 21:53:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:53:46,913 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 197 transitions. [2019-10-01 21:53:46,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-01 21:53:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2019-10-01 21:53:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-01 21:53:46,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:53:46,917 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 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 21:53:46,918 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:53:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:53:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1802007559, now seen corresponding path program 54 times [2019-10-01 21:53:46,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:53:46,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:53:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:46,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:53:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:53:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 21:53:48,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:53:48,472 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 21:53:48,568 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:54:36,404 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 21:54:36,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:36,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:54:36,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 1098 proven. 225 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2019-10-01 21:54:36,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:36,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 21:54:36,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 21:54:36,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 21:54:36,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:54:36,906 INFO L87 Difference]: Start difference. First operand 193 states and 197 transitions. Second operand 73 states. [2019-10-01 21:54:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:37,258 INFO L93 Difference]: Finished difference Result 277 states and 286 transitions. [2019-10-01 21:54:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 21:54:37,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 266 [2019-10-01 21:54:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:37,260 INFO L225 Difference]: With dead ends: 277 [2019-10-01 21:54:37,260 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 21:54:37,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:54:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 21:54:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-10-01 21:54:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-01 21:54:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2019-10-01 21:54:37,267 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 266 [2019-10-01 21:54:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:37,267 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2019-10-01 21:54:37,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 21:54:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2019-10-01 21:54:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-01 21:54:37,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:37,269 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 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 21:54:37,270 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 566100313, now seen corresponding path program 55 times [2019-10-01 21:54:37,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:37,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:37,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:37,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:37,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5696 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:38,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:38,495 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 21:54:38,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:54:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:38,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 21:54:38,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5696 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:38,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:38,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 21:54:38,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 21:54:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 21:54:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:54:38,805 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 59 states. [2019-10-01 21:54:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:39,088 INFO L93 Difference]: Finished difference Result 280 states and 288 transitions. [2019-10-01 21:54:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:54:39,089 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 270 [2019-10-01 21:54:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:39,090 INFO L225 Difference]: With dead ends: 280 [2019-10-01 21:54:39,090 INFO L226 Difference]: Without dead ends: 200 [2019-10-01 21:54:39,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 270 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 21:54:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-01 21:54:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-10-01 21:54:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 21:54:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 21:54:39,095 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 270 [2019-10-01 21:54:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:39,096 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 21:54:39,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 21:54:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 21:54:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 21:54:39,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:39,098 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 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 21:54:39,098 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -513174981, now seen corresponding path program 56 times [2019-10-01 21:54:39,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:39,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:54:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:40,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:40,460 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 21:54:40,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:54:40,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:54:40,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:40,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 21:54:40,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:40,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:40,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 21:54:40,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 21:54:40,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 21:54:40,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:54:40,739 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 60 states. [2019-10-01 21:54:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:40,897 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2019-10-01 21:54:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 21:54:40,897 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 272 [2019-10-01 21:54:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:40,898 INFO L225 Difference]: With dead ends: 282 [2019-10-01 21:54:40,898 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 21:54:40,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:54:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 21:54:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 21:54:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 21:54:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 21:54:40,905 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 272 [2019-10-01 21:54:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:40,905 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 21:54:40,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 21:54:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 21:54:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 21:54:40,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:40,907 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 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 21:54:40,908 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1685353117, now seen corresponding path program 57 times [2019-10-01 21:54:40,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:40,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:40,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:40,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:54:42,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:42,286 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 21:54:42,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:54:43,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 21:54:43,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:43,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:54:43,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4568 trivial. 0 not checked. [2019-10-01 21:54:44,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:44,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 19] total 77 [2019-10-01 21:54:44,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 21:54:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 21:54:44,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1940, Invalid=3912, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 21:54:44,433 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 77 states. [2019-10-01 21:54:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:44,907 INFO L93 Difference]: Finished difference Result 287 states and 299 transitions. [2019-10-01 21:54:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 21:54:44,908 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 274 [2019-10-01 21:54:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:44,909 INFO L225 Difference]: With dead ends: 287 [2019-10-01 21:54:44,909 INFO L226 Difference]: Without dead ends: 207 [2019-10-01 21:54:44,910 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1940, Invalid=3912, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 21:54:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-01 21:54:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-10-01 21:54:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 21:54:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-01 21:54:44,916 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 274 [2019-10-01 21:54:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:44,916 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-01 21:54:44,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 21:54:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-01 21:54:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-01 21:54:44,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:44,918 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 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 21:54:44,918 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1256833283, now seen corresponding path program 58 times [2019-10-01 21:54:44,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:44,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:44,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 21:54:46,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:46,405 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 21:54:46,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:54:46,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:54:46,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:46,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:54:46,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 4817 trivial. 0 not checked. [2019-10-01 21:54:47,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:47,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 20] total 79 [2019-10-01 21:54:47,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 21:54:47,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 21:54:47,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=4143, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:54:47,187 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 79 states. [2019-10-01 21:54:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:47,488 INFO L93 Difference]: Finished difference Result 293 states and 305 transitions. [2019-10-01 21:54:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 21:54:47,489 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 282 [2019-10-01 21:54:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:47,490 INFO L225 Difference]: With dead ends: 293 [2019-10-01 21:54:47,490 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 21:54:47,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2019, Invalid=4143, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:54:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 21:54:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-10-01 21:54:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 21:54:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-01 21:54:47,497 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 282 [2019-10-01 21:54:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:47,497 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-01 21:54:47,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 21:54:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-01 21:54:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-01 21:54:47,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:47,499 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 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 21:54:47,500 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1789919581, now seen corresponding path program 59 times [2019-10-01 21:54:47,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:47,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 21:54:48,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:48,911 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 21:54:49,018 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:57:26,209 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-10-01 21:57:26,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:57:26,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:57:26,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:57:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5080 trivial. 0 not checked. [2019-10-01 21:57:26,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:57:26,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 21] total 81 [2019-10-01 21:57:26,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 21:57:26,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 21:57:26,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2100, Invalid=4380, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:57:26,911 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 81 states. [2019-10-01 21:57:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:57:27,254 INFO L93 Difference]: Finished difference Result 299 states and 311 transitions. [2019-10-01 21:57:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 21:57:27,254 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 290 [2019-10-01 21:57:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:57:27,255 INFO L225 Difference]: With dead ends: 299 [2019-10-01 21:57:27,255 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 21:57:27,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2100, Invalid=4380, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:57:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 21:57:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-01 21:57:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-01 21:57:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-10-01 21:57:27,262 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 290 [2019-10-01 21:57:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:57:27,262 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-10-01 21:57:27,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 21:57:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-10-01 21:57:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-01 21:57:27,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:57:27,265 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 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 21:57:27,265 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:57:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:57:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2012920253, now seen corresponding path program 60 times [2019-10-01 21:57:27,266 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:57:27,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:57:27,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:57:27,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:57:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:57:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:57:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7234 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 21:57:28,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:57:28,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 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 21:57:28,922 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:58:09,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 21:58:09,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:09,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:58:09,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7234 backedges. 1530 proven. 256 refuted. 0 times theorem prover too weak. 5448 trivial. 0 not checked. [2019-10-01 21:58:09,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:09,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 19] total 80 [2019-10-01 21:58:09,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 21:58:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 21:58:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2123, Invalid=4197, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 21:58:09,977 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 80 states. [2019-10-01 21:58:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:10,402 INFO L93 Difference]: Finished difference Result 305 states and 314 transitions. [2019-10-01 21:58:10,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-01 21:58:10,407 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 298 [2019-10-01 21:58:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:10,409 INFO L225 Difference]: With dead ends: 305 [2019-10-01 21:58:10,409 INFO L226 Difference]: Without dead ends: 219 [2019-10-01 21:58:10,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2123, Invalid=4197, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 21:58:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-01 21:58:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-10-01 21:58:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-01 21:58:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2019-10-01 21:58:10,416 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 298 [2019-10-01 21:58:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:10,416 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2019-10-01 21:58:10,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 21:58:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2019-10-01 21:58:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-01 21:58:10,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:10,419 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 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 21:58:10,419 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 377853469, now seen corresponding path program 61 times [2019-10-01 21:58:10,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:10,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:10,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:10,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7388 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:12,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:12,098 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 21:58:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:58:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:12,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 21:58:12,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7388 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:12,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:12,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-10-01 21:58:12,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 21:58:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 21:58:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:58:12,408 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand 65 states. [2019-10-01 21:58:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:12,666 INFO L93 Difference]: Finished difference Result 308 states and 316 transitions. [2019-10-01 21:58:12,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 21:58:12,666 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 302 [2019-10-01 21:58:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:12,667 INFO L225 Difference]: With dead ends: 308 [2019-10-01 21:58:12,667 INFO L226 Difference]: Without dead ends: 220 [2019-10-01 21:58:12,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 21:58:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-01 21:58:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-10-01 21:58:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-01 21:58:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-10-01 21:58:12,674 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 302 [2019-10-01 21:58:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:12,674 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-10-01 21:58:12,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 21:58:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-10-01 21:58:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-01 21:58:12,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:12,677 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 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 21:58:12,677 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash -597352705, now seen corresponding path program 62 times [2019-10-01 21:58:12,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:12,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:12,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:12,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:58:12,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7511 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:14,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:14,248 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 21:58:14,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:58:14,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:58:14,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:14,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-01 21:58:14,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7511 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:14,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:14,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-10-01 21:58:14,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 21:58:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 21:58:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:58:14,557 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 66 states. [2019-10-01 21:58:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:14,743 INFO L93 Difference]: Finished difference Result 310 states and 318 transitions. [2019-10-01 21:58:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 21:58:14,743 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 304 [2019-10-01 21:58:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:14,744 INFO L225 Difference]: With dead ends: 310 [2019-10-01 21:58:14,745 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 21:58:14,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:58:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 21:58:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-10-01 21:58:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 21:58:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 21:58:14,751 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 304 [2019-10-01 21:58:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:14,751 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 21:58:14,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 21:58:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 21:58:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 21:58:14,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:14,753 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 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 21:58:14,754 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:14,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1467615391, now seen corresponding path program 63 times [2019-10-01 21:58:14,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:14,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:14,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:16,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:16,339 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 21:58:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:58:18,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 21:58:18,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:18,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:58:18,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 5817 trivial. 0 not checked. [2019-10-01 21:58:19,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:19,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 20] total 84 [2019-10-01 21:58:19,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-01 21:58:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-01 21:58:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2334, Invalid=4638, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 21:58:19,557 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 84 states. [2019-10-01 21:58:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:19,979 INFO L93 Difference]: Finished difference Result 315 states and 324 transitions. [2019-10-01 21:58:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-01 21:58:19,979 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 306 [2019-10-01 21:58:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:19,981 INFO L225 Difference]: With dead ends: 315 [2019-10-01 21:58:19,981 INFO L226 Difference]: Without dead ends: 227 [2019-10-01 21:58:19,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2334, Invalid=4638, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 21:58:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-01 21:58:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2019-10-01 21:58:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 21:58:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 21:58:19,987 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 306 [2019-10-01 21:58:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:19,987 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 21:58:19,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-01 21:58:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 21:58:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 21:58:19,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:19,990 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 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 21:58:19,990 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1308719297, now seen corresponding path program 64 times [2019-10-01 21:58:19,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:19,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7798 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 21:58:21,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:21,602 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 21:58:21,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:58:21,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:58:21,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:21,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:58:21,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7798 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 5909 trivial. 0 not checked. [2019-10-01 21:58:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:22,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 22] total 87 [2019-10-01 21:58:22,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-01 21:58:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-01 21:58:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2441, Invalid=5041, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 21:58:22,551 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 87 states. [2019-10-01 21:58:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:23,006 INFO L93 Difference]: Finished difference Result 321 states and 333 transitions. [2019-10-01 21:58:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-01 21:58:23,006 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 310 [2019-10-01 21:58:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:23,008 INFO L225 Difference]: With dead ends: 321 [2019-10-01 21:58:23,008 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 21:58:23,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2441, Invalid=5041, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 21:58:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 21:58:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-10-01 21:58:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 21:58:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 21:58:23,015 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 310 [2019-10-01 21:58:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:23,015 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 21:58:23,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-01 21:58:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 21:58:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-01 21:58:23,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:23,018 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 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 21:58:23,018 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:23,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2111779039, now seen corresponding path program 65 times [2019-10-01 21:58:23,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:23,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8284 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 21:58:24,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:24,686 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 21:58:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1