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/loop-invgen/seq-3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:50:56,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:50:56,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:50:56,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:50:56,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:50:56,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:50:56,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:50:56,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:50:56,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:50:56,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:50:56,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:50:56,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:50:56,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:50:56,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:50:56,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:50:56,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:50:56,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:50:56,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:50:56,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:50:56,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:50:56,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:50:56,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:50:56,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:50:56,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:50:56,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:50:56,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:50:56,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:50:56,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:50:56,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:50:56,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:50:56,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:50:56,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:50:56,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:50:56,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:50:56,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:50:56,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:50:56,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:50:56,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:50:56,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:50:56,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:50:56,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:50:56,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:50:56,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:50:56,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:50:56,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:50:56,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:50:56,225 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:50:56,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:50:56,225 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:50:56,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:50:56,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:50:56,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:50:56,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:50:56,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:50:56,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:50:56,226 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:50:56,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:50:56,227 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:50:56,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:50:56,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:50:56,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:50:56,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:50:56,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:50:56,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:50:56,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:50:56,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:50:56,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:50:56,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:50:56,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:50:56,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:50:56,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:50:56,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:50:56,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:50:56,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:50:56,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:50:56,278 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:50:56,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq-3.i [2019-09-03 19:50:56,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dcaee916/db28dc2bd26042b2a3ddd5c86b8ec20f/FLAGd84d3b772 [2019-09-03 19:50:56,749 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:50:56,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq-3.i [2019-09-03 19:50:56,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dcaee916/db28dc2bd26042b2a3ddd5c86b8ec20f/FLAGd84d3b772 [2019-09-03 19:50:57,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dcaee916/db28dc2bd26042b2a3ddd5c86b8ec20f [2019-09-03 19:50:57,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:50:57,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:50:57,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:57,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:50:57,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:50:57,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2243a972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57, skipping insertion in model container [2019-09-03 19:50:57,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,173 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:50:57,192 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:50:57,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:57,400 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:50:57,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:57,427 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:50:57,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57 WrapperNode [2019-09-03 19:50:57,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:57,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:50:57,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:50:57,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:50:57,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... [2019-09-03 19:50:57,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:50:57,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:50:57,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:50:57,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:50:57,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:50:57,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:50:57,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:50:57,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:50:57,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:50:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:50:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:50:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:50:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:50:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:50:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:50:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:50:57,805 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:50:57,805 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 19:50:57,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:57 BoogieIcfgContainer [2019-09-03 19:50:57,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:50:57,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:50:57,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:50:57,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:50:57,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:50:57" (1/3) ... [2019-09-03 19:50:57,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edfa9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:57, skipping insertion in model container [2019-09-03 19:50:57,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:57" (2/3) ... [2019-09-03 19:50:57,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edfa9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:57, skipping insertion in model container [2019-09-03 19:50:57,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:57" (3/3) ... [2019-09-03 19:50:57,814 INFO L109 eAbstractionObserver]: Analyzing ICFG seq-3.i [2019-09-03 19:50:57,824 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:50:57,834 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:50:57,859 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:50:57,891 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:50:57,892 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:50:57,892 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:50:57,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:50:57,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:50:57,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:50:57,892 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:50:57,893 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:50:57,893 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:50:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-03 19:50:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:50:57,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:57,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:57,923 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2112948751, now seen corresponding path program 1 times [2019-09-03 19:50:57,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:57,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:57,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:57,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:58,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:58,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:58,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:58,150 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2019-09-03 19:50:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:58,363 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2019-09-03 19:50:58,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:50:58,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 19:50:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:58,372 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:50:58,373 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:50:58,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:50:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:50:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-09-03 19:50:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:50:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-03 19:50:58,414 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-09-03 19:50:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:58,414 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-03 19:50:58,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-03 19:50:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:50:58,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:58,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:58,416 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1040035417, now seen corresponding path program 1 times [2019-09-03 19:50:58,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:58,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:58,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:58,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:58,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:58,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:58,509 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-09-03 19:50:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:58,589 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-03 19:50:58,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:50:58,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-03 19:50:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:58,592 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:50:58,592 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:50:58,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:50:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-09-03 19:50:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:50:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 19:50:58,602 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2019-09-03 19:50:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:58,603 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 19:50:58,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 19:50:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:50:58,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:58,605 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:58,605 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:58,606 INFO L82 PathProgramCache]: Analyzing trace with hash 349768240, now seen corresponding path program 1 times [2019-09-03 19:50:58,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:58,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:58,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:58,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:58,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:58,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:50:58,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:58,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:58,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-03 19:50:58,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:50:58,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:50:58,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:50:58,947 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 14 states. [2019-09-03 19:50:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:59,132 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-03 19:50:59,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:50:59,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-03 19:50:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:59,135 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:50:59,135 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:50:59,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:50:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:50:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-09-03 19:50:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:50:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-03 19:50:59,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2019-09-03 19:50:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:59,144 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-03 19:50:59,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:50:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-03 19:50:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:50:59,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:59,145 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:59,146 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1141561007, now seen corresponding path program 1 times [2019-09-03 19:50:59,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:59,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:59,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:59,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:59,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:59,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:59,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:50:59,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:59,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:59,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-03 19:50:59,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:50:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:50:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:50:59,373 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2019-09-03 19:50:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:59,553 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-09-03 19:50:59,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:50:59,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-09-03 19:50:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:59,555 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:50:59,555 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:50:59,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:50:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:50:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2019-09-03 19:50:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:50:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-03 19:50:59,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-03 19:50:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:59,573 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-03 19:50:59,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:50:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-03 19:50:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:50:59,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:59,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:59,575 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1152042552, now seen corresponding path program 2 times [2019-09-03 19:50:59,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:59,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:59,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:59,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:59,688 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-09-03 19:50:59,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:59,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:59,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:50:59,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:59,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:59,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-03 19:50:59,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:50:59,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:50:59,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:50:59,741 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-09-03 19:50:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:59,823 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-03 19:50:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:59,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-09-03 19:50:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:59,825 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:50:59,825 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:50:59,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:50:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-03 19:50:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:50:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 19:50:59,833 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2019-09-03 19:50:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:59,833 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 19:50:59,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:50:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 19:50:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:50:59,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:59,835 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:59,835 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash -805836049, now seen corresponding path program 3 times [2019-09-03 19:50:59,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:59,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:59,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:50:59,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:59,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:59,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:50:59,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:59,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:50:59,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:51:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:00,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-09-03 19:51:00,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:51:00,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:51:00,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:51:00,139 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 18 states. [2019-09-03 19:51:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:00,378 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-09-03 19:51:00,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:51:00,378 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-03 19:51:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:00,379 INFO L225 Difference]: With dead ends: 68 [2019-09-03 19:51:00,380 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:51:00,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:51:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:51:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-09-03 19:51:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:51:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 19:51:00,394 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2019-09-03 19:51:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:00,395 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 19:51:00,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:51:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 19:51:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:51:00,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:00,396 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:00,396 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1418774638, now seen corresponding path program 1 times [2019-09-03 19:51:00,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:00,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:51:00,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:00,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:00,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:00,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:51:00,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:51:00,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:00,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2019-09-03 19:51:00,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:51:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:51:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:51:00,649 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 17 states. [2019-09-03 19:51:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:00,899 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2019-09-03 19:51:00,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:51:00,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-09-03 19:51:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:00,901 INFO L225 Difference]: With dead ends: 79 [2019-09-03 19:51:00,901 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 19:51:00,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:51:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 19:51:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2019-09-03 19:51:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:51:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 19:51:00,918 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2019-09-03 19:51:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:00,918 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 19:51:00,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:51:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 19:51:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:51:00,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:00,920 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:00,921 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash -726221041, now seen corresponding path program 2 times [2019-09-03 19:51:00,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:00,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:51:01,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:01,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:01,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:01,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:01,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:01,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:51:01,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:51:01,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:01,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-09-03 19:51:01,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:51:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:51:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:51:01,176 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 16 states. [2019-09-03 19:51:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:01,393 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2019-09-03 19:51:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:51:01,394 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-09-03 19:51:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:01,395 INFO L225 Difference]: With dead ends: 92 [2019-09-03 19:51:01,395 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 19:51:01,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:51:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 19:51:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2019-09-03 19:51:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:51:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-03 19:51:01,409 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 32 [2019-09-03 19:51:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:01,410 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-03 19:51:01,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:51:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-03 19:51:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:51:01,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:01,418 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:01,418 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash -747175289, now seen corresponding path program 4 times [2019-09-03 19:51:01,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:51:01,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:01,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:01,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:01,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:01,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:01,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:51:01,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:01,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:51:01,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:01,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-03 19:51:01,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:51:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:51:01,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:51:01,573 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-09-03 19:51:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:01,656 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-09-03 19:51:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:51:01,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-09-03 19:51:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:01,660 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:51:01,660 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:51:01,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:51:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:51:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-09-03 19:51:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:51:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-03 19:51:01,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 33 [2019-09-03 19:51:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:01,669 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-03 19:51:01,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:51:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-03 19:51:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:51:01,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:01,670 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:01,670 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:01,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash -322593456, now seen corresponding path program 5 times [2019-09-03 19:51:01,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:01,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:01,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:01,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:01,829 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:51:01,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:01,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:51:01,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:01,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:01,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-09-03 19:51:01,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:51:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:51:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:51:01,990 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 22 states. [2019-09-03 19:51:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:02,227 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-03 19:51:02,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:51:02,232 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-03 19:51:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:02,234 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:51:02,234 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 19:51:02,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:51:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 19:51:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2019-09-03 19:51:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:51:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-03 19:51:02,251 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-03 19:51:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:02,253 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-03 19:51:02,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:51:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-03 19:51:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:51:02,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:02,254 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:02,255 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash -81490993, now seen corresponding path program 2 times [2019-09-03 19:51:02,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:02,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:02,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:02,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:02,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:02,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:02,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:02,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:02,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:51:02,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:02,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:02,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-09-03 19:51:02,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:51:02,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:51:02,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:51:02,595 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 21 states. [2019-09-03 19:51:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:02,883 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2019-09-03 19:51:02,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:51:02,884 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-03 19:51:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:02,885 INFO L225 Difference]: With dead ends: 100 [2019-09-03 19:51:02,885 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:51:02,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:51:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:51:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2019-09-03 19:51:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:51:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-03 19:51:02,895 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-03 19:51:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:02,896 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-03 19:51:02,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:51:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-03 19:51:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:51:02,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:02,897 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:02,897 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2013376144, now seen corresponding path program 3 times [2019-09-03 19:51:02,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:02,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:02,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:02,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:03,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:51:03,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:03,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:51:03,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:03,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:03,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2019-09-03 19:51:03,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:51:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:51:03,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:51:03,162 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 20 states. [2019-09-03 19:51:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:03,453 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2019-09-03 19:51:03,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:51:03,454 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-09-03 19:51:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:03,455 INFO L225 Difference]: With dead ends: 114 [2019-09-03 19:51:03,455 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:51:03,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:51:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:51:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2019-09-03 19:51:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:51:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-03 19:51:03,465 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-03 19:51:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:03,465 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-03 19:51:03,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:51:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-03 19:51:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:51:03,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:03,466 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:03,467 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:03,467 INFO L82 PathProgramCache]: Analyzing trace with hash 972346287, now seen corresponding path program 3 times [2019-09-03 19:51:03,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:03,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:03,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:03,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:03,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:03,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:03,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:03,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:03,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:51:03,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:03,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:51:03,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:03,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:03,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-09-03 19:51:03,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:51:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:51:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:51:03,715 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 19 states. [2019-09-03 19:51:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:04,049 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2019-09-03 19:51:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:51:04,051 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-03 19:51:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:04,053 INFO L225 Difference]: With dead ends: 130 [2019-09-03 19:51:04,053 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:51:04,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:51:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:51:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 52. [2019-09-03 19:51:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:51:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-09-03 19:51:04,076 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 40 [2019-09-03 19:51:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:04,076 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-09-03 19:51:04,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:51:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-09-03 19:51:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:51:04,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:04,077 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:04,077 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash 803183848, now seen corresponding path program 6 times [2019-09-03 19:51:04,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:04,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:04,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:04,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:04,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:04,158 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:51:04,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:04,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:04,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:04,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:51:04,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:04,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-03 19:51:04,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:51:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:51:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:51:04,186 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 11 states. [2019-09-03 19:51:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:04,289 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-03 19:51:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:51:04,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-03 19:51:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:04,291 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:51:04,291 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 19:51:04,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:51:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 19:51:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-09-03 19:51:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:51:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-09-03 19:51:04,300 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 41 [2019-09-03 19:51:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:04,301 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-09-03 19:51:04,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:51:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-09-03 19:51:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:51:04,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:04,304 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:04,304 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash 481149903, now seen corresponding path program 7 times [2019-09-03 19:51:04,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:04,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:04,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:04,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:04,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:04,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:04,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:04,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:04,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:04,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:04,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2019-09-03 19:51:04,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:51:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:51:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:51:04,701 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 26 states. [2019-09-03 19:51:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:04,973 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2019-09-03 19:51:04,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:51:04,974 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-03 19:51:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:04,975 INFO L225 Difference]: With dead ends: 102 [2019-09-03 19:51:04,975 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 19:51:04,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:51:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 19:51:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-09-03 19:51:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:51:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 19:51:04,984 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 19:51:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:04,985 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 19:51:04,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:51:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 19:51:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:51:04,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:04,986 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:04,986 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 439468878, now seen corresponding path program 4 times [2019-09-03 19:51:04,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:05,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:05,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:05,129 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:05,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:05,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:05,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:05,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:05,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:05,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2019-09-03 19:51:05,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:51:05,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:51:05,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:51:05,318 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 25 states. [2019-09-03 19:51:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:05,657 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2019-09-03 19:51:05,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:51:05,658 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-09-03 19:51:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:05,659 INFO L225 Difference]: With dead ends: 121 [2019-09-03 19:51:05,659 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 19:51:05,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:51:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 19:51:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-09-03 19:51:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:51:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 19:51:05,668 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 19:51:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:05,669 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 19:51:05,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:51:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 19:51:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:51:05,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:05,670 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:05,670 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1501538321, now seen corresponding path program 5 times [2019-09-03 19:51:05,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:05,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:05,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:05,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:05,795 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:05,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-03 19:51:05,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:05,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:05,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:05,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:05,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2019-09-03 19:51:05,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:51:05,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:51:05,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:51:05,998 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 24 states. [2019-09-03 19:51:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:06,347 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2019-09-03 19:51:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:51:06,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-09-03 19:51:06,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:06,349 INFO L225 Difference]: With dead ends: 139 [2019-09-03 19:51:06,349 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:51:06,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:51:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:51:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 60. [2019-09-03 19:51:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:51:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 19:51:06,359 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 19:51:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:06,359 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 19:51:06,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:51:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 19:51:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:51:06,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:06,360 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:06,360 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1068247854, now seen corresponding path program 6 times [2019-09-03 19:51:06,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:06,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:06,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:06,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:06,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:06,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:06,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:06,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:06,531 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 19:51:06,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:06,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:06,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:06,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:06,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-03 19:51:06,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:51:06,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:51:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:51:06,683 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 23 states. [2019-09-03 19:51:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:07,066 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2019-09-03 19:51:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:51:07,067 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-03 19:51:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:07,069 INFO L225 Difference]: With dead ends: 156 [2019-09-03 19:51:07,069 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 19:51:07,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:51:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 19:51:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 60. [2019-09-03 19:51:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:51:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-03 19:51:07,085 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-03 19:51:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:07,085 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-03 19:51:07,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:51:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-03 19:51:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:51:07,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:07,087 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:07,087 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1982428175, now seen corresponding path program 4 times [2019-09-03 19:51:07,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:07,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:07,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:07,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:07,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:07,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:07,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:07,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:07,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:07,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:07,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-09-03 19:51:07,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:51:07,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:51:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:51:07,369 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 22 states. [2019-09-03 19:51:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:07,705 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2019-09-03 19:51:07,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:51:07,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-03 19:51:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:07,708 INFO L225 Difference]: With dead ends: 175 [2019-09-03 19:51:07,708 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 19:51:07,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:51:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 19:51:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 62. [2019-09-03 19:51:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 19:51:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-09-03 19:51:07,720 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 48 [2019-09-03 19:51:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:07,720 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-09-03 19:51:07,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:51:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-09-03 19:51:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:51:07,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:07,721 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:07,721 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1778035559, now seen corresponding path program 8 times [2019-09-03 19:51:07,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:07,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:07,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:07,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:07,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:07,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:07,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:07,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:07,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:07,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:07,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:07,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:51:07,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:07,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-03 19:51:07,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:51:07,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:51:07,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:51:07,860 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 12 states. [2019-09-03 19:51:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:07,978 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-09-03 19:51:07,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:51:07,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-03 19:51:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:07,979 INFO L225 Difference]: With dead ends: 75 [2019-09-03 19:51:07,979 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 19:51:07,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:51:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 19:51:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-09-03 19:51:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:51:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-09-03 19:51:07,987 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 49 [2019-09-03 19:51:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:07,987 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-09-03 19:51:07,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:51:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-09-03 19:51:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:51:07,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:07,988 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:07,989 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash 928790640, now seen corresponding path program 9 times [2019-09-03 19:51:07,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:07,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:07,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:08,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:08,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:08,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:08,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:51:08,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:08,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:08,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:08,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:08,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2019-09-03 19:51:08,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:51:08,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:51:08,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:51:08,486 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 30 states. [2019-09-03 19:51:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:08,851 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2019-09-03 19:51:08,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:51:08,852 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-09-03 19:51:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:08,853 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:51:08,854 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 19:51:08,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:51:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 19:51:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2019-09-03 19:51:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:51:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 19:51:08,862 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 19:51:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:08,862 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 19:51:08,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:51:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 19:51:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:51:08,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:08,863 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:08,863 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1167832849, now seen corresponding path program 7 times [2019-09-03 19:51:08,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:08,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:09,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:09,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:09,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:09,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:09,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:09,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2019-09-03 19:51:09,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:51:09,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:51:09,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:51:09,349 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 29 states. [2019-09-03 19:51:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:09,804 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2019-09-03 19:51:09,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:51:09,807 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-09-03 19:51:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:09,808 INFO L225 Difference]: With dead ends: 142 [2019-09-03 19:51:09,808 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:51:09,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:51:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:51:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2019-09-03 19:51:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:51:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 19:51:09,819 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 19:51:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:09,819 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 19:51:09,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:51:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 19:51:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:51:09,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:09,820 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:09,821 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash -404181872, now seen corresponding path program 8 times [2019-09-03 19:51:09,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:09,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:09,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:09,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:09,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:09,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:09,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:09,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:09,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:09,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:10,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:10,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 28 [2019-09-03 19:51:10,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:51:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:51:10,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:51:10,157 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 28 states. [2019-09-03 19:51:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:10,679 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2019-09-03 19:51:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:51:10,679 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-09-03 19:51:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:10,680 INFO L225 Difference]: With dead ends: 164 [2019-09-03 19:51:10,680 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 19:51:10,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:51:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 19:51:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 70. [2019-09-03 19:51:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:51:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 19:51:10,694 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 19:51:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:10,694 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 19:51:10,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:51:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 19:51:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:51:10,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:10,695 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:10,695 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash 174641359, now seen corresponding path program 9 times [2019-09-03 19:51:10,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:10,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:10,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:10,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:10,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:10,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:10,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:10,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:51:10,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:10,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:10,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:11,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:11,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2019-09-03 19:51:11,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:51:11,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:51:11,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:51:11,027 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 27 states. [2019-09-03 19:51:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:11,552 INFO L93 Difference]: Finished difference Result 185 states and 226 transitions. [2019-09-03 19:51:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:51:11,553 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-03 19:51:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:11,554 INFO L225 Difference]: With dead ends: 185 [2019-09-03 19:51:11,554 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 19:51:11,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:51:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 19:51:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 70. [2019-09-03 19:51:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:51:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 19:51:11,567 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 19:51:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:11,567 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 19:51:11,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:51:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 19:51:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:51:11,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:11,568 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:11,568 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 54765744, now seen corresponding path program 10 times [2019-09-03 19:51:11,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:11,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:11,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:11,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:11,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:11,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:11,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:11,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:11,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:11,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2019-09-03 19:51:11,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:51:11,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:51:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:51:11,892 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 26 states. [2019-09-03 19:51:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:12,362 INFO L93 Difference]: Finished difference Result 205 states and 253 transitions. [2019-09-03 19:51:12,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:51:12,363 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-03 19:51:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:12,364 INFO L225 Difference]: With dead ends: 205 [2019-09-03 19:51:12,364 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 19:51:12,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:51:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 19:51:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 70. [2019-09-03 19:51:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:51:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-03 19:51:12,377 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-03 19:51:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:12,377 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-03 19:51:12,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:51:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-03 19:51:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:51:12,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:12,378 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:12,378 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:12,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1750216529, now seen corresponding path program 5 times [2019-09-03 19:51:12,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:12,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:12,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:12,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:12,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:12,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:12,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:12,523 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:51:12,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:12,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:12,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:12,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:12,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-09-03 19:51:12,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:51:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:51:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:51:12,675 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 25 states. [2019-09-03 19:51:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:13,099 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2019-09-03 19:51:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:51:13,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2019-09-03 19:51:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:13,102 INFO L225 Difference]: With dead ends: 227 [2019-09-03 19:51:13,102 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 19:51:13,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:51:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 19:51:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 72. [2019-09-03 19:51:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 19:51:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-09-03 19:51:13,119 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 56 [2019-09-03 19:51:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:13,119 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-09-03 19:51:13,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:51:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-09-03 19:51:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:51:13,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:13,120 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:13,120 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:13,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:13,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1098123272, now seen corresponding path program 10 times [2019-09-03 19:51:13,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:13,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:13,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:13,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:13,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:13,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:13,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:13,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:13,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:13,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:13,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:13,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:51:13,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:13,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-03 19:51:13,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:51:13,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:51:13,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:51:13,317 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 13 states. [2019-09-03 19:51:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:13,418 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-09-03 19:51:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:51:13,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-09-03 19:51:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:13,419 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:51:13,419 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 19:51:13,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:51:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 19:51:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-03 19:51:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:51:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-09-03 19:51:13,430 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 57 [2019-09-03 19:51:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:13,431 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-09-03 19:51:13,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:51:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-09-03 19:51:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:51:13,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:13,432 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:13,432 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash -159345489, now seen corresponding path program 11 times [2019-09-03 19:51:13,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:13,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:13,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:13,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:13,611 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:13,633 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:51:13,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:13,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:13,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:13,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:13,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2019-09-03 19:51:13,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:51:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:51:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:51:13,912 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 34 states. [2019-09-03 19:51:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:14,522 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2019-09-03 19:51:14,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:51:14,523 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-09-03 19:51:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:14,524 INFO L225 Difference]: With dead ends: 136 [2019-09-03 19:51:14,524 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 19:51:14,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:51:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 19:51:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-09-03 19:51:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:51:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 19:51:14,538 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 19:51:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:14,538 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 19:51:14,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:51:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 19:51:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:51:14,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:14,540 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:14,540 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:14,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:14,541 INFO L82 PathProgramCache]: Analyzing trace with hash -966019538, now seen corresponding path program 11 times [2019-09-03 19:51:14,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:14,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:14,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:14,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:14,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:14,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-03 19:51:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:14,867 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:51:14,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:14,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:14,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:15,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:15,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2019-09-03 19:51:15,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:51:15,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:51:15,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:51:15,268 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 33 states. [2019-09-03 19:51:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:15,906 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2019-09-03 19:51:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:51:15,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-09-03 19:51:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:15,907 INFO L225 Difference]: With dead ends: 163 [2019-09-03 19:51:15,907 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 19:51:15,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:51:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 19:51:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2019-09-03 19:51:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:51:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 19:51:15,921 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 19:51:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:15,921 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 19:51:15,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:51:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 19:51:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:51:15,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:15,923 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:15,923 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash -437851953, now seen corresponding path program 12 times [2019-09-03 19:51:15,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:15,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:15,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:15,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:15,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:16,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:16,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:16,139 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:51:16,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:16,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:16,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:16,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:16,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2019-09-03 19:51:16,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:51:16,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:51:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:51:16,393 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 32 states. [2019-09-03 19:51:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:16,964 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2019-09-03 19:51:16,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:51:16,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-09-03 19:51:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:16,966 INFO L225 Difference]: With dead ends: 189 [2019-09-03 19:51:16,966 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:51:16,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:51:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:51:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2019-09-03 19:51:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:51:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 19:51:16,982 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 19:51:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:16,982 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 19:51:16,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:51:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 19:51:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:51:16,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:16,983 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:16,983 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1529192946, now seen corresponding path program 13 times [2019-09-03 19:51:16,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:16,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:16,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:16,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:16,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:17,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:17,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:17,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:17,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:17,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:17,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2019-09-03 19:51:17,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:51:17,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:51:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:51:17,424 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 31 states. [2019-09-03 19:51:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:18,097 INFO L93 Difference]: Finished difference Result 214 states and 261 transitions. [2019-09-03 19:51:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:51:18,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-03 19:51:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:18,099 INFO L225 Difference]: With dead ends: 214 [2019-09-03 19:51:18,100 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 19:51:18,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:51:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 19:51:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 80. [2019-09-03 19:51:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:51:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 19:51:18,119 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 19:51:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:18,120 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 19:51:18,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:51:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 19:51:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:51:18,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:18,121 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:18,122 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash -317471505, now seen corresponding path program 14 times [2019-09-03 19:51:18,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:18,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:18,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:18,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:18,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:18,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:18,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:18,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:18,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:18,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:18,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:18,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2019-09-03 19:51:18,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:51:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:51:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:51:18,617 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 30 states. [2019-09-03 19:51:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:19,352 INFO L93 Difference]: Finished difference Result 238 states and 293 transitions. [2019-09-03 19:51:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:51:19,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-03 19:51:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:19,354 INFO L225 Difference]: With dead ends: 238 [2019-09-03 19:51:19,354 INFO L226 Difference]: Without dead ends: 209 [2019-09-03 19:51:19,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:51:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-03 19:51:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 80. [2019-09-03 19:51:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:51:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 19:51:19,388 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 19:51:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:19,389 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 19:51:19,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:51:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 19:51:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:51:19,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:19,390 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:19,391 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1802404370, now seen corresponding path program 15 times [2019-09-03 19:51:19,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:19,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:19,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:19,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:19,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:19,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:19,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:19,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 19:51:19,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:19,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:19,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:20,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2019-09-03 19:51:20,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:51:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:51:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:51:20,013 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 29 states. [2019-09-03 19:51:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:20,644 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2019-09-03 19:51:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:51:20,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2019-09-03 19:51:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:20,647 INFO L225 Difference]: With dead ends: 261 [2019-09-03 19:51:20,647 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 19:51:20,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:51:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 19:51:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 80. [2019-09-03 19:51:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:51:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-03 19:51:20,667 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-03 19:51:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:20,668 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-03 19:51:20,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:51:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-03 19:51:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:51:20,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:20,669 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:20,669 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash -603379441, now seen corresponding path program 6 times [2019-09-03 19:51:20,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:20,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:20,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:20,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:20,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:20,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:20,839 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:20,860 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:51:20,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:20,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:20,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:21,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:21,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-09-03 19:51:21,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:51:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:51:21,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:51:21,082 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 28 states. [2019-09-03 19:51:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:21,736 INFO L93 Difference]: Finished difference Result 286 states and 358 transitions. [2019-09-03 19:51:21,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:51:21,737 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2019-09-03 19:51:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:21,739 INFO L225 Difference]: With dead ends: 286 [2019-09-03 19:51:21,739 INFO L226 Difference]: Without dead ends: 257 [2019-09-03 19:51:21,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:51:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-03 19:51:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 82. [2019-09-03 19:51:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 19:51:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-09-03 19:51:21,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 64 [2019-09-03 19:51:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:21,773 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-09-03 19:51:21,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:51:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-09-03 19:51:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 19:51:21,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:21,774 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:21,775 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1476086855, now seen corresponding path program 12 times [2019-09-03 19:51:21,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:21,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:21,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:21,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:21,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:21,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:21,917 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:21,953 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:51:21,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:21,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:21,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:51:22,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:22,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-03 19:51:22,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:51:22,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:51:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:51:22,002 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 14 states. [2019-09-03 19:51:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:22,157 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-09-03 19:51:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:51:22,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-03 19:51:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:22,159 INFO L225 Difference]: With dead ends: 95 [2019-09-03 19:51:22,159 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 19:51:22,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:51:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 19:51:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-09-03 19:51:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:51:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-09-03 19:51:22,175 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 65 [2019-09-03 19:51:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:22,175 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-09-03 19:51:22,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:51:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-09-03 19:51:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:22,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:22,176 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:22,177 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash 711908240, now seen corresponding path program 13 times [2019-09-03 19:51:22,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:22,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:22,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:22,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:22,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:22,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:22,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:22,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:22,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2019-09-03 19:51:22,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:51:22,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:51:22,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:51:22,832 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 38 states. [2019-09-03 19:51:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:23,474 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2019-09-03 19:51:23,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:51:23,475 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-09-03 19:51:23,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:23,476 INFO L225 Difference]: With dead ends: 153 [2019-09-03 19:51:23,476 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 19:51:23,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:51:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 19:51:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2019-09-03 19:51:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:51:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 19:51:23,489 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 19:51:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:23,489 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 19:51:23,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:51:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 19:51:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:23,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:23,490 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:23,490 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:23,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1067191823, now seen corresponding path program 16 times [2019-09-03 19:51:23,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:23,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:23,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:23,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:23,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:23,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:23,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:23,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:24,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2019-09-03 19:51:24,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:51:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:51:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:51:24,066 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 37 states. [2019-09-03 19:51:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:24,839 INFO L93 Difference]: Finished difference Result 184 states and 219 transitions. [2019-09-03 19:51:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:51:24,840 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-09-03 19:51:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:24,841 INFO L225 Difference]: With dead ends: 184 [2019-09-03 19:51:24,842 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 19:51:24,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:51:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 19:51:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2019-09-03 19:51:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:51:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 19:51:24,867 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 19:51:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:24,869 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 19:51:24,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:51:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 19:51:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:24,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:24,870 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:24,870 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1355747248, now seen corresponding path program 17 times [2019-09-03 19:51:24,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:24,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:24,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:24,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:24,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:25,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:25,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:25,055 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:25,084 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-03 19:51:25,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:25,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:25,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:25,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:25,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2019-09-03 19:51:25,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:51:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:51:25,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:51:25,367 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 36 states. [2019-09-03 19:51:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:26,074 INFO L93 Difference]: Finished difference Result 214 states and 258 transitions. [2019-09-03 19:51:26,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:51:26,074 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-09-03 19:51:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:26,075 INFO L225 Difference]: With dead ends: 214 [2019-09-03 19:51:26,076 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 19:51:26,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:51:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 19:51:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 90. [2019-09-03 19:51:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:51:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 19:51:26,099 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 19:51:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:26,099 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 19:51:26,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:51:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 19:51:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:26,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:26,100 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:26,100 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash 810866159, now seen corresponding path program 18 times [2019-09-03 19:51:26,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:26,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:26,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:26,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:26,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:26,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:26,320 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-03 19:51:26,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:26,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:26,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:26,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:26,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 35 [2019-09-03 19:51:26,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:51:26,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:51:26,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:51:26,613 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 35 states. [2019-09-03 19:51:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:27,418 INFO L93 Difference]: Finished difference Result 243 states and 296 transitions. [2019-09-03 19:51:27,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:51:27,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-03 19:51:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:27,419 INFO L225 Difference]: With dead ends: 243 [2019-09-03 19:51:27,420 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 19:51:27,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:51:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 19:51:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 90. [2019-09-03 19:51:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:51:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 19:51:27,445 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 19:51:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:27,445 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 19:51:27,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:51:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 19:51:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:27,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:27,447 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:27,447 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1007825968, now seen corresponding path program 19 times [2019-09-03 19:51:27,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:27,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:27,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:27,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:27,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:27,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:28,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:28,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2019-09-03 19:51:28,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:51:28,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:51:28,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:51:28,014 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 34 states. [2019-09-03 19:51:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:28,822 INFO L93 Difference]: Finished difference Result 271 states and 333 transitions. [2019-09-03 19:51:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:51:28,822 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-03 19:51:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:28,824 INFO L225 Difference]: With dead ends: 271 [2019-09-03 19:51:28,824 INFO L226 Difference]: Without dead ends: 239 [2019-09-03 19:51:28,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:51:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-03 19:51:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 90. [2019-09-03 19:51:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:51:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 19:51:28,854 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 19:51:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:28,854 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 19:51:28,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:51:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 19:51:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:28,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:28,855 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:28,855 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2120095183, now seen corresponding path program 20 times [2019-09-03 19:51:28,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:28,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:28,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:29,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:29,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:29,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:29,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:29,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:29,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:29,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:29,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:29,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2019-09-03 19:51:29,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:51:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:51:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:51:29,356 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 33 states. [2019-09-03 19:51:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:30,216 INFO L93 Difference]: Finished difference Result 298 states and 369 transitions. [2019-09-03 19:51:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:51:30,217 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 72 [2019-09-03 19:51:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:30,218 INFO L225 Difference]: With dead ends: 298 [2019-09-03 19:51:30,218 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 19:51:30,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:51:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 19:51:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 90. [2019-09-03 19:51:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:51:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 19:51:30,245 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 19:51:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:30,245 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 19:51:30,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:51:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 19:51:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:30,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:30,246 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:30,246 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:30,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash 835522544, now seen corresponding path program 21 times [2019-09-03 19:51:30,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:30,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:30,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:30,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:30,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:30,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:30,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:30,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:30,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 19:51:30,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:30,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:30,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:30,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:30,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2019-09-03 19:51:30,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:51:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:51:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:51:30,695 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 32 states. [2019-09-03 19:51:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:31,482 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2019-09-03 19:51:31,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:51:31,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 72 [2019-09-03 19:51:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:31,484 INFO L225 Difference]: With dead ends: 324 [2019-09-03 19:51:31,484 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 19:51:31,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:51:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 19:51:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 90. [2019-09-03 19:51:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:51:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-03 19:51:31,509 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-03 19:51:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:31,509 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-03 19:51:31,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:51:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-03 19:51:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:51:31,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:31,510 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:31,510 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1284125265, now seen corresponding path program 7 times [2019-09-03 19:51:31,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:31,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:31,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:31,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:31,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:31,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:31,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:31,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:32,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:32,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2019-09-03 19:51:32,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:51:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:51:32,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:51:32,149 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 31 states. [2019-09-03 19:51:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:32,844 INFO L93 Difference]: Finished difference Result 352 states and 442 transitions. [2019-09-03 19:51:32,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:51:32,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2019-09-03 19:51:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:32,846 INFO L225 Difference]: With dead ends: 352 [2019-09-03 19:51:32,846 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 19:51:32,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:51:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 19:51:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 92. [2019-09-03 19:51:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 19:51:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-09-03 19:51:32,882 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 72 [2019-09-03 19:51:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:32,882 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-09-03 19:51:32,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:51:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-09-03 19:51:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 19:51:32,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:32,883 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:32,883 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1709472552, now seen corresponding path program 14 times [2019-09-03 19:51:32,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:32,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:32,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:32,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:32,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:32,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:33,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:33,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:33,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:33,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:33,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:33,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:33,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-03 19:51:33,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:51:33,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:51:33,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:51:33,048 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 15 states. [2019-09-03 19:51:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:33,222 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-09-03 19:51:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:51:33,223 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-03 19:51:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:33,224 INFO L225 Difference]: With dead ends: 105 [2019-09-03 19:51:33,224 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 19:51:33,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:51:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 19:51:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-09-03 19:51:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 19:51:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-09-03 19:51:33,250 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 73 [2019-09-03 19:51:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:33,250 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-09-03 19:51:33,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:51:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-09-03 19:51:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:33,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:33,251 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:33,251 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:33,251 INFO L82 PathProgramCache]: Analyzing trace with hash 392060303, now seen corresponding path program 15 times [2019-09-03 19:51:33,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:33,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:33,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:33,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:33,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:33,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:33,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:51:33,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:33,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:33,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:33,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:33,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2019-09-03 19:51:33,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:51:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:51:33,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:51:33,915 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 42 states. [2019-09-03 19:51:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:34,634 INFO L93 Difference]: Finished difference Result 170 states and 199 transitions. [2019-09-03 19:51:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:51:34,634 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-09-03 19:51:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:34,635 INFO L225 Difference]: With dead ends: 170 [2019-09-03 19:51:34,635 INFO L226 Difference]: Without dead ends: 135 [2019-09-03 19:51:34,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:51:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-03 19:51:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-09-03 19:51:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:34,665 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:34,665 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:34,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:51:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:34,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:34,666 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:34,666 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:34,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1691574002, now seen corresponding path program 22 times [2019-09-03 19:51:34,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:34,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:34,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:34,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:34,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:34,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:34,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:34,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:34,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:34,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:35,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:35,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2019-09-03 19:51:35,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:51:35,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:51:35,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:51:35,417 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 41 states. [2019-09-03 19:51:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:36,114 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2019-09-03 19:51:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:51:36,115 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-09-03 19:51:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:36,116 INFO L225 Difference]: With dead ends: 205 [2019-09-03 19:51:36,116 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 19:51:36,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:51:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 19:51:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2019-09-03 19:51:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:36,148 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:36,148 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:36,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:51:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:36,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:36,149 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:36,150 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1289253295, now seen corresponding path program 23 times [2019-09-03 19:51:36,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:36,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:36,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:36,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:36,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:36,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:36,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:36,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:36,439 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-03 19:51:36,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:36,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:36,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:36,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:36,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2019-09-03 19:51:36,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:51:36,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:51:36,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:51:36,786 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 40 states. [2019-09-03 19:51:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:37,740 INFO L93 Difference]: Finished difference Result 239 states and 288 transitions. [2019-09-03 19:51:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:51:37,740 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-09-03 19:51:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:37,741 INFO L225 Difference]: With dead ends: 239 [2019-09-03 19:51:37,741 INFO L226 Difference]: Without dead ends: 204 [2019-09-03 19:51:37,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:51:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-03 19:51:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 100. [2019-09-03 19:51:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:37,775 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:37,776 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:37,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:51:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:37,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:37,777 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:37,777 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1108314350, now seen corresponding path program 24 times [2019-09-03 19:51:37,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:37,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:37,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:37,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:37,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:37,988 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:38,017 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-03 19:51:38,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:38,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:38,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:38,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2019-09-03 19:51:38,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:51:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:51:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:51:38,334 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 39 states. [2019-09-03 19:51:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:39,327 INFO L93 Difference]: Finished difference Result 272 states and 331 transitions. [2019-09-03 19:51:39,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:51:39,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 80 [2019-09-03 19:51:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:39,328 INFO L225 Difference]: With dead ends: 272 [2019-09-03 19:51:39,328 INFO L226 Difference]: Without dead ends: 237 [2019-09-03 19:51:39,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:51:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-03 19:51:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 100. [2019-09-03 19:51:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:39,357 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:39,357 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:39,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:51:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:39,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:39,358 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:39,358 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:39,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1945563697, now seen corresponding path program 25 times [2019-09-03 19:51:39,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:39,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:39,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:39,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:39,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:39,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:39,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:39,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:39,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:39,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:40,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:40,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 38 [2019-09-03 19:51:40,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:51:40,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:51:40,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:51:40,150 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 38 states. [2019-09-03 19:51:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:41,248 INFO L93 Difference]: Finished difference Result 304 states and 373 transitions. [2019-09-03 19:51:41,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:51:41,248 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-03 19:51:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:41,250 INFO L225 Difference]: With dead ends: 304 [2019-09-03 19:51:41,250 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 19:51:41,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:51:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 19:51:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 100. [2019-09-03 19:51:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:41,281 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:41,282 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:41,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:51:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:41,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:41,282 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:41,282 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash 172681422, now seen corresponding path program 26 times [2019-09-03 19:51:41,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:41,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:41,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:41,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:41,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:41,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:41,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:41,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:41,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:41,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:41,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:41,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:41,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 37 [2019-09-03 19:51:41,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:51:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:51:41,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:51:41,855 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 37 states. [2019-09-03 19:51:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:42,902 INFO L93 Difference]: Finished difference Result 335 states and 414 transitions. [2019-09-03 19:51:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:51:42,902 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 80 [2019-09-03 19:51:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:42,904 INFO L225 Difference]: With dead ends: 335 [2019-09-03 19:51:42,904 INFO L226 Difference]: Without dead ends: 300 [2019-09-03 19:51:42,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:51:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-03 19:51:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 100. [2019-09-03 19:51:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:42,944 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:42,944 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:42,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:51:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:42,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:42,945 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:42,946 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1626485231, now seen corresponding path program 27 times [2019-09-03 19:51:42,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:42,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:42,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:42,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:43,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:43,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:43,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:43,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:51:43,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:43,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:43,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:43,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:43,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 36 [2019-09-03 19:51:43,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:51:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:51:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:51:43,477 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 36 states. [2019-09-03 19:51:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:44,471 INFO L93 Difference]: Finished difference Result 365 states and 454 transitions. [2019-09-03 19:51:44,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:51:44,471 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-09-03 19:51:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:44,473 INFO L225 Difference]: With dead ends: 365 [2019-09-03 19:51:44,473 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 19:51:44,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:51:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 19:51:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 100. [2019-09-03 19:51:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:44,515 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:44,515 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:44,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:51:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:44,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:44,516 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:44,516 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash -543375186, now seen corresponding path program 28 times [2019-09-03 19:51:44,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:44,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:44,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:44,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:44,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:44,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:44,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:44,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:44,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:44,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:44,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:44,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:45,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:45,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2019-09-03 19:51:45,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:51:45,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:51:45,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:51:45,136 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 35 states. [2019-09-03 19:51:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:46,056 INFO L93 Difference]: Finished difference Result 394 states and 493 transitions. [2019-09-03 19:51:46,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:51:46,056 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2019-09-03 19:51:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:46,058 INFO L225 Difference]: With dead ends: 394 [2019-09-03 19:51:46,058 INFO L226 Difference]: Without dead ends: 359 [2019-09-03 19:51:46,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:51:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-03 19:51:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 100. [2019-09-03 19:51:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-03 19:51:46,097 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-03 19:51:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:46,098 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-03 19:51:46,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:51:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-03 19:51:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:51:46,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:46,098 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:46,098 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1880481295, now seen corresponding path program 8 times [2019-09-03 19:51:46,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:46,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:46,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:46,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:46,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:46,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:46,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:46,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:46,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:46,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:46,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:46,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:46,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:46,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2019-09-03 19:51:46,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:51:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:51:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:51:46,638 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 34 states. [2019-09-03 19:51:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:47,506 INFO L93 Difference]: Finished difference Result 425 states and 535 transitions. [2019-09-03 19:51:47,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:51:47,506 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 80 [2019-09-03 19:51:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:47,508 INFO L225 Difference]: With dead ends: 425 [2019-09-03 19:51:47,508 INFO L226 Difference]: Without dead ends: 390 [2019-09-03 19:51:47,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:51:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-03 19:51:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 102. [2019-09-03 19:51:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 19:51:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2019-09-03 19:51:47,552 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 80 [2019-09-03 19:51:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:47,552 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2019-09-03 19:51:47,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:51:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2019-09-03 19:51:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 19:51:47,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:47,553 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:47,553 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1754864345, now seen corresponding path program 16 times [2019-09-03 19:51:47,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:47,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:47,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:47,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:47,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:47,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:47,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:47,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:47,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:47,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:47,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:51:47,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:47,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-09-03 19:51:47,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:51:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:51:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:51:47,738 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 16 states. [2019-09-03 19:51:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:47,916 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2019-09-03 19:51:47,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:51:47,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-03 19:51:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:47,918 INFO L225 Difference]: With dead ends: 115 [2019-09-03 19:51:47,918 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 19:51:47,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:51:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 19:51:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-09-03 19:51:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 19:51:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-09-03 19:51:47,952 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 81 [2019-09-03 19:51:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:47,952 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-09-03 19:51:47,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:51:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-09-03 19:51:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:51:47,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:47,953 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:47,953 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1682933424, now seen corresponding path program 17 times [2019-09-03 19:51:47,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:47,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:47,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:47,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:48,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:48,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:48,266 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:51:48,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:48,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:48,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:48,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:48,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2019-09-03 19:51:48,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:51:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:51:48,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:51:48,776 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 46 states. [2019-09-03 19:51:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:49,538 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2019-09-03 19:51:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:51:49,539 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-09-03 19:51:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:49,540 INFO L225 Difference]: With dead ends: 187 [2019-09-03 19:51:49,540 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 19:51:49,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:51:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 19:51:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2019-09-03 19:51:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:51:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:51:49,583 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:51:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:49,584 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:51:49,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:51:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:51:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:51:49,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:49,584 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:49,585 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1323443409, now seen corresponding path program 29 times [2019-09-03 19:51:49,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:49,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:49,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:49,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:49,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:49,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:51:49,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:49,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:49,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:50,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:50,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2019-09-03 19:51:50,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:51:50,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:51:50,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:51:50,323 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 45 states. [2019-09-03 19:51:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:51,260 INFO L93 Difference]: Finished difference Result 226 states and 269 transitions. [2019-09-03 19:51:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:51:51,260 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-09-03 19:51:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:51,261 INFO L225 Difference]: With dead ends: 226 [2019-09-03 19:51:51,261 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 19:51:51,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:51:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 19:51:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 110. [2019-09-03 19:51:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:51:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:51:51,309 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:51:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:51,310 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:51:51,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:51:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:51:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:51:51,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:51,311 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:51,311 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1627618000, now seen corresponding path program 30 times [2019-09-03 19:51:51,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:51,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:51,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:51,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:51,650 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:51:51,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:51,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:51,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:52,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:52,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2019-09-03 19:51:52,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:51:52,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:51:52,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:51:52,060 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 44 states. [2019-09-03 19:51:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:53,221 INFO L93 Difference]: Finished difference Result 264 states and 318 transitions. [2019-09-03 19:51:53,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:51:53,232 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-09-03 19:51:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:53,234 INFO L225 Difference]: With dead ends: 264 [2019-09-03 19:51:53,234 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 19:51:53,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:51:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 19:51:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 110. [2019-09-03 19:51:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:51:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:51:53,269 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:51:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:53,269 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:51:53,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:51:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:51:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:51:53,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:53,270 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:53,271 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash -771038449, now seen corresponding path program 31 times [2019-09-03 19:51:53,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:53,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:53,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:53,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:53,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:53,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:53,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:53,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:53,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:53,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2019-09-03 19:51:53,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:51:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:51:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:51:53,960 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 43 states. [2019-09-03 19:51:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:54,938 INFO L93 Difference]: Finished difference Result 301 states and 366 transitions. [2019-09-03 19:51:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:51:54,939 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 88 [2019-09-03 19:51:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:54,940 INFO L225 Difference]: With dead ends: 301 [2019-09-03 19:51:54,940 INFO L226 Difference]: Without dead ends: 263 [2019-09-03 19:51:54,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:51:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-03 19:51:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 110. [2019-09-03 19:51:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:51:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:51:54,993 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:51:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:54,993 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:51:54,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:51:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:51:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:51:54,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:54,994 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:54,994 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:54,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:54,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1402603792, now seen corresponding path program 32 times [2019-09-03 19:51:54,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:54,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:54,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:54,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:54,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:55,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:55,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:55,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:55,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:55,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:55,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:55,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:55,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:55,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2019-09-03 19:51:55,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:51:55,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:51:55,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:51:55,860 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 42 states. [2019-09-03 19:51:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:57,099 INFO L93 Difference]: Finished difference Result 337 states and 413 transitions. [2019-09-03 19:51:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:51:57,099 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-03 19:51:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:57,101 INFO L225 Difference]: With dead ends: 337 [2019-09-03 19:51:57,101 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 19:51:57,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2438 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:51:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 19:51:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 110. [2019-09-03 19:51:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:51:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:51:57,144 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:51:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:57,144 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:51:57,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:51:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:51:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:51:57,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:57,145 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:57,145 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1347969775, now seen corresponding path program 33 times [2019-09-03 19:51:57,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:57,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:57,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:57,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:57,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:57,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:57,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:51:57,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:57,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:57,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:57,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:57,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 41 [2019-09-03 19:51:57,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:51:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:51:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:51:57,880 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 41 states. [2019-09-03 19:51:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:59,118 INFO L93 Difference]: Finished difference Result 372 states and 459 transitions. [2019-09-03 19:51:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:51:59,118 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 88 [2019-09-03 19:51:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:59,120 INFO L225 Difference]: With dead ends: 372 [2019-09-03 19:51:59,120 INFO L226 Difference]: Without dead ends: 334 [2019-09-03 19:51:59,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:51:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-03 19:51:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 110. [2019-09-03 19:51:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:51:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:51:59,176 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:51:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:59,176 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:51:59,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:51:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:51:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:51:59,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:59,177 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:59,178 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1334248688, now seen corresponding path program 34 times [2019-09-03 19:51:59,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:59,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:59,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:59,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:59,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:59,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:59,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:59,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:51:59,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:59,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2019-09-03 19:51:59,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:51:59,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:51:59,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:51:59,826 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 40 states. [2019-09-03 19:52:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:01,014 INFO L93 Difference]: Finished difference Result 406 states and 504 transitions. [2019-09-03 19:52:01,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:52:01,014 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 88 [2019-09-03 19:52:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:01,016 INFO L225 Difference]: With dead ends: 406 [2019-09-03 19:52:01,016 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 19:52:01,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:52:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 19:52:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 110. [2019-09-03 19:52:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:52:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:52:01,082 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:52:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:01,082 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:52:01,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:52:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:52:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:52:01,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:01,083 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:01,084 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2042911439, now seen corresponding path program 35 times [2019-09-03 19:52:01,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:01,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:01,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:01,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:01,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:52:01,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:01,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:01,364 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:52:01,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:01,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:52:01,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:52:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 39 [2019-09-03 19:52:01,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:52:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:52:01,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:52:01,711 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 39 states. [2019-09-03 19:52:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:02,918 INFO L93 Difference]: Finished difference Result 439 states and 548 transitions. [2019-09-03 19:52:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:52:02,918 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 88 [2019-09-03 19:52:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:02,921 INFO L225 Difference]: With dead ends: 439 [2019-09-03 19:52:02,921 INFO L226 Difference]: Without dead ends: 401 [2019-09-03 19:52:02,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:52:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-03 19:52:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 110. [2019-09-03 19:52:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:52:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:52:02,963 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:52:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:02,964 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:52:02,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:52:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:52:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:52:02,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:02,965 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:02,965 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1874757424, now seen corresponding path program 36 times [2019-09-03 19:52:02,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:02,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:02,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:02,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:02,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:52:03,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:03,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:03,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:03,257 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:52:03,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:03,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:52:03,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:52:03,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:03,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2019-09-03 19:52:03,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:52:03,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:52:03,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:52:03,570 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 38 states. [2019-09-03 19:52:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:04,689 INFO L93 Difference]: Finished difference Result 471 states and 591 transitions. [2019-09-03 19:52:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:52:04,689 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2019-09-03 19:52:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:04,691 INFO L225 Difference]: With dead ends: 471 [2019-09-03 19:52:04,691 INFO L226 Difference]: Without dead ends: 433 [2019-09-03 19:52:04,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:52:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-03 19:52:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 110. [2019-09-03 19:52:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 19:52:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-03 19:52:04,741 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-03 19:52:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:04,741 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-03 19:52:04,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:52:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-03 19:52:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:52:04,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:04,742 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:04,742 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash -208876881, now seen corresponding path program 9 times [2019-09-03 19:52:04,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:04,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:52:04,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:04,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:04,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:05,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:52:05,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:05,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:52:05,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:52:05,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:05,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2019-09-03 19:52:05,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:52:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:52:05,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:52:05,422 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 37 states. [2019-09-03 19:52:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:06,827 INFO L93 Difference]: Finished difference Result 505 states and 637 transitions. [2019-09-03 19:52:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:52:06,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2019-09-03 19:52:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:06,829 INFO L225 Difference]: With dead ends: 505 [2019-09-03 19:52:06,830 INFO L226 Difference]: Without dead ends: 467 [2019-09-03 19:52:06,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:52:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-03 19:52:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 112. [2019-09-03 19:52:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:52:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2019-09-03 19:52:06,892 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 88 [2019-09-03 19:52:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:06,893 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2019-09-03 19:52:06,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:52:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2019-09-03 19:52:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-03 19:52:06,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:06,894 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:06,894 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2072180296, now seen corresponding path program 18 times [2019-09-03 19:52:06,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:06,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:06,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:06,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:06,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:52:06,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:06,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:07,004 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:07,056 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:52:07,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:07,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:07,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:07,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:07,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-03 19:52:07,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:52:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:52:07,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:52:07,092 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 17 states. [2019-09-03 19:52:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:07,264 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2019-09-03 19:52:07,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:52:07,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-03 19:52:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:07,266 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:52:07,266 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 19:52:07,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:52:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 19:52:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-03 19:52:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 19:52:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-09-03 19:52:07,313 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 89 [2019-09-03 19:52:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:07,313 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-09-03 19:52:07,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:52:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-09-03 19:52:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:07,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:07,314 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:07,314 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1085611631, now seen corresponding path program 19 times [2019-09-03 19:52:07,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:07,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:07,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:07,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:07,647 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:07,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:07,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:07,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:08,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:08,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2019-09-03 19:52:08,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:52:08,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:52:08,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1955, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:52:08,241 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 50 states. [2019-09-03 19:52:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:09,200 INFO L93 Difference]: Finished difference Result 204 states and 239 transitions. [2019-09-03 19:52:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:52:09,200 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-09-03 19:52:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:09,201 INFO L225 Difference]: With dead ends: 204 [2019-09-03 19:52:09,201 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 19:52:09,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:52:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 19:52:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 120. [2019-09-03 19:52:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:09,257 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:09,257 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:09,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:52:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:09,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:09,258 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:09,258 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash -505248786, now seen corresponding path program 37 times [2019-09-03 19:52:09,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:09,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:09,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:09,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:09,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:09,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:09,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:10,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:10,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 49 [2019-09-03 19:52:10,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:52:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:52:10,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:52:10,221 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 49 states. [2019-09-03 19:52:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:11,266 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2019-09-03 19:52:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:52:11,270 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-09-03 19:52:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:11,271 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:52:11,271 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 19:52:11,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2099 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:52:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 19:52:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 120. [2019-09-03 19:52:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:11,322 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:11,322 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:11,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:52:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:11,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:11,323 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:11,323 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:11,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1664945521, now seen corresponding path program 38 times [2019-09-03 19:52:11,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:11,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:11,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:11,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:11,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:11,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:11,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:11,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:11,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:11,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:11,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:12,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:12,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2019-09-03 19:52:12,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:52:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:52:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:52:12,458 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 48 states. [2019-09-03 19:52:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:13,853 INFO L93 Difference]: Finished difference Result 289 states and 348 transitions. [2019-09-03 19:52:13,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:52:13,853 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-09-03 19:52:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:13,855 INFO L225 Difference]: With dead ends: 289 [2019-09-03 19:52:13,855 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 19:52:13,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2531 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:52:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 19:52:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 120. [2019-09-03 19:52:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:13,980 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:13,981 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:13,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:52:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:13,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:13,982 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:13,983 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1622780878, now seen corresponding path program 39 times [2019-09-03 19:52:13,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:13,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:14,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:14,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:14,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:14,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 19:52:14,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:14,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:14,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:14,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:14,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 47 [2019-09-03 19:52:14,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:52:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:52:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:52:14,807 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 47 states. [2019-09-03 19:52:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:16,074 INFO L93 Difference]: Finished difference Result 330 states and 401 transitions. [2019-09-03 19:52:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:52:16,074 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 96 [2019-09-03 19:52:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:16,075 INFO L225 Difference]: With dead ends: 330 [2019-09-03 19:52:16,075 INFO L226 Difference]: Without dead ends: 289 [2019-09-03 19:52:16,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:52:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-03 19:52:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 120. [2019-09-03 19:52:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:16,136 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:16,136 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:16,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:52:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:16,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:16,137 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:16,137 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 343363247, now seen corresponding path program 40 times [2019-09-03 19:52:16,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:16,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:16,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:16,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:16,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:16,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:16,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:16,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:16,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:16,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:16,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2019-09-03 19:52:16,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:52:16,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:52:16,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:52:16,929 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 46 states. [2019-09-03 19:52:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:18,216 INFO L93 Difference]: Finished difference Result 370 states and 453 transitions. [2019-09-03 19:52:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:52:18,216 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-03 19:52:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:18,217 INFO L225 Difference]: With dead ends: 370 [2019-09-03 19:52:18,217 INFO L226 Difference]: Without dead ends: 329 [2019-09-03 19:52:18,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3099 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:52:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-03 19:52:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 120. [2019-09-03 19:52:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:18,271 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:18,271 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:18,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:52:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:18,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:18,272 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:18,272 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:18,273 INFO L82 PathProgramCache]: Analyzing trace with hash -252097618, now seen corresponding path program 41 times [2019-09-03 19:52:18,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:18,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:18,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:18,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:18,573 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:18,605 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-03 19:52:18,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:18,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:18,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:18,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:18,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 45 [2019-09-03 19:52:18,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:52:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:52:18,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:52:18,999 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 45 states. [2019-09-03 19:52:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:20,444 INFO L93 Difference]: Finished difference Result 409 states and 504 transitions. [2019-09-03 19:52:20,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:52:20,444 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 96 [2019-09-03 19:52:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:20,446 INFO L225 Difference]: With dead ends: 409 [2019-09-03 19:52:20,446 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 19:52:20,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1759, Invalid=7943, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:52:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 19:52:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 120. [2019-09-03 19:52:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:20,516 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:20,516 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:20,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:52:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:20,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:20,517 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:20,517 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -271306033, now seen corresponding path program 42 times [2019-09-03 19:52:20,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:20,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:20,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:20,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:20,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:20,880 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:20,937 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-03 19:52:20,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:20,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:20,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:21,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:21,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 44 [2019-09-03 19:52:21,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:52:21,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:52:21,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1535, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:52:21,503 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 44 states. [2019-09-03 19:52:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:23,080 INFO L93 Difference]: Finished difference Result 447 states and 554 transitions. [2019-09-03 19:52:23,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:52:23,081 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 96 [2019-09-03 19:52:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:23,082 INFO L225 Difference]: With dead ends: 447 [2019-09-03 19:52:23,082 INFO L226 Difference]: Without dead ends: 406 [2019-09-03 19:52:23,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3118 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:52:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-03 19:52:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 120. [2019-09-03 19:52:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:23,147 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:23,147 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:23,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:52:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:23,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:23,148 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:23,148 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1113547662, now seen corresponding path program 43 times [2019-09-03 19:52:23,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:23,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:23,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:23,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:23,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:23,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:23,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:23,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:23,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:23,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 43 [2019-09-03 19:52:23,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:52:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:52:23,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:52:23,878 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 43 states. [2019-09-03 19:52:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:25,389 INFO L93 Difference]: Finished difference Result 484 states and 603 transitions. [2019-09-03 19:52:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:52:25,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 96 [2019-09-03 19:52:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:25,392 INFO L225 Difference]: With dead ends: 484 [2019-09-03 19:52:25,392 INFO L226 Difference]: Without dead ends: 443 [2019-09-03 19:52:25,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2901 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:52:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-03 19:52:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 120. [2019-09-03 19:52:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:25,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:25,451 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:25,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:52:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:25,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:25,452 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:25,452 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1889820945, now seen corresponding path program 44 times [2019-09-03 19:52:25,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:25,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:25,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:25,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:25,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:25,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:25,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:25,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:25,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:25,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:25,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:26,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:26,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 42 [2019-09-03 19:52:26,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:52:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:52:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:52:26,076 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 42 states. [2019-09-03 19:52:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:27,591 INFO L93 Difference]: Finished difference Result 520 states and 651 transitions. [2019-09-03 19:52:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:52:27,592 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-09-03 19:52:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:27,596 INFO L225 Difference]: With dead ends: 520 [2019-09-03 19:52:27,596 INFO L226 Difference]: Without dead ends: 479 [2019-09-03 19:52:27,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2540 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:52:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-03 19:52:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 120. [2019-09-03 19:52:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:27,672 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:27,672 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:27,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:52:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:27,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:27,673 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:27,673 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -601230482, now seen corresponding path program 45 times [2019-09-03 19:52:27,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:27,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:27,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:27,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:27,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:27,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:28,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 19:52:28,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:28,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:28,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:28,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:28,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2019-09-03 19:52:28,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:52:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:52:28,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:52:28,366 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 41 states. [2019-09-03 19:52:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:29,852 INFO L93 Difference]: Finished difference Result 555 states and 698 transitions. [2019-09-03 19:52:29,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:52:29,853 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 96 [2019-09-03 19:52:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:29,855 INFO L225 Difference]: With dead ends: 555 [2019-09-03 19:52:29,855 INFO L226 Difference]: Without dead ends: 514 [2019-09-03 19:52:29,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:52:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-03 19:52:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 120. [2019-09-03 19:52:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:52:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-03 19:52:29,922 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-03 19:52:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:29,923 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-03 19:52:29,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:52:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-03 19:52:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:52:29,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:29,923 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:29,923 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1945136369, now seen corresponding path program 10 times [2019-09-03 19:52:29,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:29,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:29,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:29,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:30,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:30,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:30,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:30,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:30,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:52:30,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:30,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:30,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2019-09-03 19:52:30,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:52:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:52:30,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:52:30,550 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 40 states. [2019-09-03 19:52:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:31,886 INFO L93 Difference]: Finished difference Result 592 states and 748 transitions. [2019-09-03 19:52:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:52:31,887 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 96 [2019-09-03 19:52:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:31,889 INFO L225 Difference]: With dead ends: 592 [2019-09-03 19:52:31,890 INFO L226 Difference]: Without dead ends: 551 [2019-09-03 19:52:31,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:52:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-03 19:52:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 122. [2019-09-03 19:52:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 19:52:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2019-09-03 19:52:31,956 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 96 [2019-09-03 19:52:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:31,956 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2019-09-03 19:52:31,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:52:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2019-09-03 19:52:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 19:52:31,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,957 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,957 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 699102727, now seen corresponding path program 20 times [2019-09-03 19:52:31,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:52:32,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:32,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:32,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:32,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:32,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:32,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:32,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:32,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (76)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:32,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-09-03 19:52:32,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:52:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:52:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:52:32,180 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 18 states. [2019-09-03 19:52:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:32,433 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2019-09-03 19:52:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:52:32,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-09-03 19:52:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:32,435 INFO L225 Difference]: With dead ends: 135 [2019-09-03 19:52:32,435 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 19:52:32,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:52:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 19:52:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-09-03 19:52:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 19:52:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-09-03 19:52:32,498 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 97 [2019-09-03 19:52:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:32,498 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-09-03 19:52:32,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:52:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-09-03 19:52:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:32,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:32,499 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:32,500 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash 198195664, now seen corresponding path program 21 times [2019-09-03 19:52:32,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:32,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:32,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:32,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:32,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:32,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:32,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:52:32,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:32,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:32,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:33,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:33,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 54 [2019-09-03 19:52:33,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:52:33,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:52:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:52:33,392 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 54 states. [2019-09-03 19:52:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:34,606 INFO L93 Difference]: Finished difference Result 221 states and 259 transitions. [2019-09-03 19:52:34,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:52:34,607 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-09-03 19:52:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:34,608 INFO L225 Difference]: With dead ends: 221 [2019-09-03 19:52:34,608 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 19:52:34,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:52:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 19:52:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 130. [2019-09-03 19:52:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:34,675 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:34,675 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:34,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:52:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:34,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:34,676 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:34,676 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1111773105, now seen corresponding path program 46 times [2019-09-03 19:52:34,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:34,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:34,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:34,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:34,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:34,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:34,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:34,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:35,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:35,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:35,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:35,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:35,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:35,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 53 [2019-09-03 19:52:35,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:52:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:52:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:52:35,555 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 53 states. [2019-09-03 19:52:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:36,754 INFO L93 Difference]: Finished difference Result 268 states and 319 transitions. [2019-09-03 19:52:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:52:36,755 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-09-03 19:52:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:36,756 INFO L225 Difference]: With dead ends: 268 [2019-09-03 19:52:36,756 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 19:52:36,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:52:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 19:52:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 130. [2019-09-03 19:52:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:36,829 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:36,830 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:36,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:52:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:36,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:36,831 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:36,831 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1062727152, now seen corresponding path program 47 times [2019-09-03 19:52:36,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:36,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:37,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:37,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:37,157 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:37,193 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:52:37,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:37,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:37,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:37,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:37,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 52 [2019-09-03 19:52:37,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:52:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:52:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:52:37,698 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 52 states. [2019-09-03 19:52:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:39,322 INFO L93 Difference]: Finished difference Result 314 states and 378 transitions. [2019-09-03 19:52:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:52:39,322 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-09-03 19:52:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:39,325 INFO L225 Difference]: With dead ends: 314 [2019-09-03 19:52:39,325 INFO L226 Difference]: Without dead ends: 270 [2019-09-03 19:52:39,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3054 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:52:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-03 19:52:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 130. [2019-09-03 19:52:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:39,414 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:39,414 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:39,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:52:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:39,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:39,415 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:39,415 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1638074321, now seen corresponding path program 48 times [2019-09-03 19:52:39,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:39,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:39,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:39,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:39,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:39,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:39,775 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:39,814 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-09-03 19:52:39,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:39,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:39,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:40,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:40,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 51 [2019-09-03 19:52:40,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:52:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:52:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2071, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:52:40,421 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 51 states. [2019-09-03 19:52:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:42,232 INFO L93 Difference]: Finished difference Result 359 states and 436 transitions. [2019-09-03 19:52:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:52:42,232 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 104 [2019-09-03 19:52:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:42,234 INFO L225 Difference]: With dead ends: 359 [2019-09-03 19:52:42,234 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 19:52:42,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3509 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:52:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 19:52:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 130. [2019-09-03 19:52:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:42,318 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:42,319 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:42,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:52:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:42,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:42,319 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:42,319 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash -478270960, now seen corresponding path program 49 times [2019-09-03 19:52:42,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:42,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:42,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:42,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:42,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:42,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:42,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:42,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:42,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:43,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:43,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 50 [2019-09-03 19:52:43,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:52:43,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:52:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:52:43,158 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 50 states. [2019-09-03 19:52:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:44,936 INFO L93 Difference]: Finished difference Result 403 states and 493 transitions. [2019-09-03 19:52:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:52:44,936 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-03 19:52:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:44,938 INFO L225 Difference]: With dead ends: 403 [2019-09-03 19:52:44,938 INFO L226 Difference]: Without dead ends: 359 [2019-09-03 19:52:44,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3839 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:52:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-03 19:52:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 130. [2019-09-03 19:52:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:45,024 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:45,024 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:45,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:52:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:45,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:45,025 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:45,025 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:45,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1133594609, now seen corresponding path program 50 times [2019-09-03 19:52:45,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:45,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:45,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:45,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:45,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:45,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:45,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:45,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:45,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:45,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:45,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 49 [2019-09-03 19:52:45,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:52:45,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:52:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:52:45,850 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 49 states. [2019-09-03 19:52:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:47,635 INFO L93 Difference]: Finished difference Result 446 states and 549 transitions. [2019-09-03 19:52:47,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:52:47,636 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 104 [2019-09-03 19:52:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:47,637 INFO L225 Difference]: With dead ends: 446 [2019-09-03 19:52:47,637 INFO L226 Difference]: Without dead ends: 402 [2019-09-03 19:52:47,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:52:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-03 19:52:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 130. [2019-09-03 19:52:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:47,723 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:47,723 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:47,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:52:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:47,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:47,724 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:47,724 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash 507833904, now seen corresponding path program 51 times [2019-09-03 19:52:47,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:47,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:47,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:47,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:48,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:48,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:48,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:48,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:52:48,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:48,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:48,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:48,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:48,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 48 [2019-09-03 19:52:48,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:52:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:52:48,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:52:48,529 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 48 states. [2019-09-03 19:52:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:50,434 INFO L93 Difference]: Finished difference Result 488 states and 604 transitions. [2019-09-03 19:52:50,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:52:50,434 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 104 [2019-09-03 19:52:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:50,436 INFO L225 Difference]: With dead ends: 488 [2019-09-03 19:52:50,436 INFO L226 Difference]: Without dead ends: 444 [2019-09-03 19:52:50,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:52:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-03 19:52:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 130. [2019-09-03 19:52:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:50,560 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:50,560 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:50,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:52:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:50,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:50,561 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:50,563 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:50,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:50,563 INFO L82 PathProgramCache]: Analyzing trace with hash 699330543, now seen corresponding path program 52 times [2019-09-03 19:52:50,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:50,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:50,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:50,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:51,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:51,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:51,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:51,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:51,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:51,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:51,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:51,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 47 [2019-09-03 19:52:51,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:52:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:52:51,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:52:51,553 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 47 states. [2019-09-03 19:52:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:53,429 INFO L93 Difference]: Finished difference Result 529 states and 658 transitions. [2019-09-03 19:52:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:52:53,430 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-09-03 19:52:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:53,432 INFO L225 Difference]: With dead ends: 529 [2019-09-03 19:52:53,432 INFO L226 Difference]: Without dead ends: 485 [2019-09-03 19:52:53,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3875 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:52:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-03 19:52:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 130. [2019-09-03 19:52:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:53,552 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:53,552 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:53,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:52:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:53,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:53,553 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:53,553 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1372702128, now seen corresponding path program 53 times [2019-09-03 19:52:53,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:53,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:53,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:53,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:53,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:53,885 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:52:53,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:53,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:53,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:54,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:54,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 46 [2019-09-03 19:52:54,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:52:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:52:54,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1671, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:52:54,298 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 46 states. [2019-09-03 19:52:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:56,264 INFO L93 Difference]: Finished difference Result 569 states and 711 transitions. [2019-09-03 19:52:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:52:56,265 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 104 [2019-09-03 19:52:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:56,267 INFO L225 Difference]: With dead ends: 569 [2019-09-03 19:52:56,267 INFO L226 Difference]: Without dead ends: 525 [2019-09-03 19:52:56,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3549 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:52:56,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-03 19:52:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 130. [2019-09-03 19:52:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:56,355 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:56,355 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:56,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:52:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:56,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:56,356 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:56,356 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1331404751, now seen corresponding path program 54 times [2019-09-03 19:52:56,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:56,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:56,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:56,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:56,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:56,673 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:56,712 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-09-03 19:52:56,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:56,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:56,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:57,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:57,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2019-09-03 19:52:57,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:52:57,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:52:57,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:52:57,222 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 45 states. [2019-09-03 19:52:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:59,133 INFO L93 Difference]: Finished difference Result 608 states and 763 transitions. [2019-09-03 19:52:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:52:59,133 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 104 [2019-09-03 19:52:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:59,136 INFO L225 Difference]: With dead ends: 608 [2019-09-03 19:52:59,136 INFO L226 Difference]: Without dead ends: 564 [2019-09-03 19:52:59,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:52:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-03 19:52:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 130. [2019-09-03 19:52:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:52:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:52:59,296 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:52:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:59,297 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:52:59,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:52:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:52:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:52:59,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:59,298 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:59,298 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash 171708016, now seen corresponding path program 55 times [2019-09-03 19:52:59,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:59,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:59,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:52:59,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:59,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:59,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:59,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:52:59,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:53:00,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:00,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 44 [2019-09-03 19:53:00,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:53:00,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:53:00,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:53:00,316 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 44 states. [2019-09-03 19:53:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:02,198 INFO L93 Difference]: Finished difference Result 646 states and 814 transitions. [2019-09-03 19:53:02,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:53:02,199 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 104 [2019-09-03 19:53:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:02,202 INFO L225 Difference]: With dead ends: 646 [2019-09-03 19:53:02,202 INFO L226 Difference]: Without dead ends: 602 [2019-09-03 19:53:02,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:53:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-03 19:53:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 130. [2019-09-03 19:53:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:53:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-03 19:53:02,340 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-03 19:53:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:02,340 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-03 19:53:02,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:53:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-03 19:53:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:53:02,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:02,341 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:02,342 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash -835532881, now seen corresponding path program 11 times [2019-09-03 19:53:02,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:02,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:53:02,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:02,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:02,667 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:53:02,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:02,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:53:02,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:53:03,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:03,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2019-09-03 19:53:03,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:53:03,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:53:03,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:53:03,052 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 43 states. [2019-09-03 19:53:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:04,652 INFO L93 Difference]: Finished difference Result 686 states and 868 transitions. [2019-09-03 19:53:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:53:04,652 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 104 [2019-09-03 19:53:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:04,654 INFO L225 Difference]: With dead ends: 686 [2019-09-03 19:53:04,655 INFO L226 Difference]: Without dead ends: 642 [2019-09-03 19:53:04,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:53:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-03 19:53:04,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 132. [2019-09-03 19:53:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 19:53:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2019-09-03 19:53:04,763 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 104 [2019-09-03 19:53:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:04,763 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2019-09-03 19:53:04,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:53:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2019-09-03 19:53:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-03 19:53:04,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:04,764 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:04,764 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash -383682200, now seen corresponding path program 22 times [2019-09-03 19:53:04,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:04,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:53:04,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:04,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:04,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:04,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:04,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:04,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:04,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:04,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:53:04,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:04,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-09-03 19:53:04,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:53:04,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:53:04,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:53:04,974 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 19 states. [2019-09-03 19:53:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:05,268 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2019-09-03 19:53:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:53:05,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2019-09-03 19:53:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:05,270 INFO L225 Difference]: With dead ends: 145 [2019-09-03 19:53:05,270 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 19:53:05,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:53:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 19:53:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-09-03 19:53:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 19:53:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2019-09-03 19:53:05,359 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 105 [2019-09-03 19:53:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:05,359 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2019-09-03 19:53:05,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:53:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2019-09-03 19:53:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:05,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:05,361 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:05,361 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash 460511055, now seen corresponding path program 23 times [2019-09-03 19:53:05,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:05,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:05,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:05,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:05,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:05,808 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:53:05,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:05,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:05,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:06,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:06,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 58 [2019-09-03 19:53:06,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:53:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:53:06,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=2645, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:53:06,429 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 58 states. [2019-09-03 19:53:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:07,737 INFO L93 Difference]: Finished difference Result 238 states and 279 transitions. [2019-09-03 19:53:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:53:07,738 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-09-03 19:53:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:07,740 INFO L225 Difference]: With dead ends: 238 [2019-09-03 19:53:07,740 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 19:53:07,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2270 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1403, Invalid=5907, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:53:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 19:53:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2019-09-03 19:53:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:08,004 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:08,005 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:08,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:53:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:08,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:08,006 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:08,007 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:08,007 INFO L82 PathProgramCache]: Analyzing trace with hash -881107250, now seen corresponding path program 56 times [2019-09-03 19:53:08,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:08,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:08,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:08,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:08,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:08,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:08,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:08,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:08,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:08,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:08,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:08,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 57 [2019-09-03 19:53:09,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:53:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:53:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=2570, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:53:09,938 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 57 states. [2019-09-03 19:53:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:12,168 INFO L93 Difference]: Finished difference Result 289 states and 344 transitions. [2019-09-03 19:53:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:53:12,169 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-09-03 19:53:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:12,170 INFO L225 Difference]: With dead ends: 289 [2019-09-03 19:53:12,170 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 19:53:12,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2962 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1711, Invalid=7601, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:53:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 19:53:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 140. [2019-09-03 19:53:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:12,280 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:12,280 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:12,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:53:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:12,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:12,281 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:12,281 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2123656047, now seen corresponding path program 57 times [2019-09-03 19:53:12,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:12,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:12,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:12,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:12,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:12,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 19:53:12,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:12,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:12,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:13,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:13,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 56 [2019-09-03 19:53:13,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:53:13,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:53:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=2493, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:53:13,301 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 56 states. [2019-09-03 19:53:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:14,913 INFO L93 Difference]: Finished difference Result 339 states and 408 transitions. [2019-09-03 19:53:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:53:14,913 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2019-09-03 19:53:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:14,915 INFO L225 Difference]: With dead ends: 339 [2019-09-03 19:53:14,915 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 19:53:14,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2008, Invalid=9122, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:53:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 19:53:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 140. [2019-09-03 19:53:15,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:15,021 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:15,021 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:15,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:53:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:15,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:15,022 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:15,022 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash 835110574, now seen corresponding path program 58 times [2019-09-03 19:53:15,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:15,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:15,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:15,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:15,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:15,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:15,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:15,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:15,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:15,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:15,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (93)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:15,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:15,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 55 [2019-09-03 19:53:15,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:53:15,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:53:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2414, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:53:15,954 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 55 states. [2019-09-03 19:53:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:17,697 INFO L93 Difference]: Finished difference Result 388 states and 471 transitions. [2019-09-03 19:53:17,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:53:17,697 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 112 [2019-09-03 19:53:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:17,699 INFO L225 Difference]: With dead ends: 388 [2019-09-03 19:53:17,699 INFO L226 Difference]: Without dead ends: 341 [2019-09-03 19:53:17,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4206 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2267, Invalid=10389, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:53:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-03 19:53:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 140. [2019-09-03 19:53:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:17,811 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:17,811 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:17,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:53:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:17,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:17,811 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:17,812 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash 793544591, now seen corresponding path program 59 times [2019-09-03 19:53:17,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:17,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:17,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:18,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:18,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:18,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:18,160 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:53:18,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:18,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:18,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:18,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:18,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 54 [2019-09-03 19:53:18,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:53:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:53:18,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:53:18,711 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 54 states. [2019-09-03 19:53:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:21,152 INFO L93 Difference]: Finished difference Result 436 states and 533 transitions. [2019-09-03 19:53:21,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:53:21,153 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-03 19:53:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:21,154 INFO L225 Difference]: With dead ends: 436 [2019-09-03 19:53:21,154 INFO L226 Difference]: Without dead ends: 389 [2019-09-03 19:53:21,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4658 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2467, Invalid=11339, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:53:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-03 19:53:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 140. [2019-09-03 19:53:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:21,285 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:21,285 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:21,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:53:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:21,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:21,285 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:21,286 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:21,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2039129742, now seen corresponding path program 60 times [2019-09-03 19:53:21,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:21,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:21,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:21,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:21,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:21,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:21,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:21,724 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:21,763 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:53:21,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:21,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:21,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:22,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:22,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 53 [2019-09-03 19:53:22,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:53:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:53:22,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=2250, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:53:22,297 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 53 states. [2019-09-03 19:53:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:24,795 INFO L93 Difference]: Finished difference Result 483 states and 594 transitions. [2019-09-03 19:53:24,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:53:24,795 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 112 [2019-09-03 19:53:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:24,797 INFO L225 Difference]: With dead ends: 483 [2019-09-03 19:53:24,797 INFO L226 Difference]: Without dead ends: 436 [2019-09-03 19:53:24,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2593, Invalid=11927, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:53:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-03 19:53:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 140. [2019-09-03 19:53:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:24,925 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:24,925 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:24,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:53:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:24,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:24,926 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:24,926 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash 832383919, now seen corresponding path program 61 times [2019-09-03 19:53:24,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:24,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:24,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:25,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:25,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:25,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:25,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:25,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:25,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:25,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 52 [2019-09-03 19:53:25,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:53:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:53:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:53:25,822 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 52 states. [2019-09-03 19:53:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:28,392 INFO L93 Difference]: Finished difference Result 529 states and 654 transitions. [2019-09-03 19:53:28,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:53:28,393 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 112 [2019-09-03 19:53:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:28,395 INFO L225 Difference]: With dead ends: 529 [2019-09-03 19:53:28,395 INFO L226 Difference]: Without dead ends: 482 [2019-09-03 19:53:28,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5062 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2636, Invalid=12126, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:53:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-03 19:53:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 140. [2019-09-03 19:53:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:28,516 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:28,516 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:28,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:53:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:28,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:28,517 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:28,517 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash 377814638, now seen corresponding path program 62 times [2019-09-03 19:53:28,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:28,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:28,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:28,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:28,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:28,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:28,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:28,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:28,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:28,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:29,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 51 [2019-09-03 19:53:29,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:53:29,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:53:29,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2078, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:53:29,382 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 51 states. [2019-09-03 19:53:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:31,908 INFO L93 Difference]: Finished difference Result 574 states and 713 transitions. [2019-09-03 19:53:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 19:53:31,908 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 112 [2019-09-03 19:53:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:31,910 INFO L225 Difference]: With dead ends: 574 [2019-09-03 19:53:31,911 INFO L226 Difference]: Without dead ends: 527 [2019-09-03 19:53:31,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4985 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2593, Invalid=11927, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:53:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-03 19:53:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 140. [2019-09-03 19:53:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:32,030 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:32,030 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:32,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:53:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:32,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:32,031 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:32,031 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1576511537, now seen corresponding path program 63 times [2019-09-03 19:53:32,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:32,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:32,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:32,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:32,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:32,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:32,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 19:53:32,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:32,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:32,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:32,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:32,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 50 [2019-09-03 19:53:32,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:53:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:53:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:53:32,917 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 50 states. [2019-09-03 19:53:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:35,372 INFO L93 Difference]: Finished difference Result 618 states and 771 transitions. [2019-09-03 19:53:35,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:53:35,372 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 112 [2019-09-03 19:53:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:35,375 INFO L225 Difference]: With dead ends: 618 [2019-09-03 19:53:35,375 INFO L226 Difference]: Without dead ends: 571 [2019-09-03 19:53:35,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4716 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2467, Invalid=11339, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:53:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-03 19:53:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 140. [2019-09-03 19:53:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:35,497 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:35,497 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:35,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:53:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:35,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:35,498 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:35,498 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1408486990, now seen corresponding path program 64 times [2019-09-03 19:53:35,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:35,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:35,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:35,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:35,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:35,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:35,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:35,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:35,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:36,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:36,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 49 [2019-09-03 19:53:36,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:53:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:53:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:53:36,328 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 49 states. [2019-09-03 19:53:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:38,771 INFO L93 Difference]: Finished difference Result 661 states and 828 transitions. [2019-09-03 19:53:38,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:53:38,771 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 112 [2019-09-03 19:53:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:38,773 INFO L225 Difference]: With dead ends: 661 [2019-09-03 19:53:38,773 INFO L226 Difference]: Without dead ends: 614 [2019-09-03 19:53:38,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4263 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2267, Invalid=10389, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:53:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-03 19:53:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 140. [2019-09-03 19:53:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:38,897 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:38,897 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:38,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:53:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:38,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:38,898 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:38,898 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:38,898 INFO L82 PathProgramCache]: Analyzing trace with hash -711980049, now seen corresponding path program 65 times [2019-09-03 19:53:38,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:38,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:38,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:38,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:39,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:39,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:39,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:39,239 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:53:39,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:39,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:39,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:39,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:39,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 48 [2019-09-03 19:53:39,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:53:39,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:53:39,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1805, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:53:39,688 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 48 states. [2019-09-03 19:53:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:42,023 INFO L93 Difference]: Finished difference Result 703 states and 884 transitions. [2019-09-03 19:53:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:53:42,023 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 112 [2019-09-03 19:53:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:42,026 INFO L225 Difference]: With dead ends: 703 [2019-09-03 19:53:42,027 INFO L226 Difference]: Without dead ends: 656 [2019-09-03 19:53:42,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3646 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2008, Invalid=9122, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:53:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-03 19:53:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 140. [2019-09-03 19:53:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:42,173 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:42,173 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:42,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:53:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:42,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:42,174 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:42,174 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:42,174 INFO L82 PathProgramCache]: Analyzing trace with hash 882185774, now seen corresponding path program 66 times [2019-09-03 19:53:42,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:42,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:42,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:42,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:42,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:42,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:42,486 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:42,526 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:53:42,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:42,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:42,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:42,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:42,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 47 [2019-09-03 19:53:42,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:53:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:53:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:53:42,975 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 47 states. [2019-09-03 19:53:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,391 INFO L93 Difference]: Finished difference Result 744 states and 939 transitions. [2019-09-03 19:53:45,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:53:45,392 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 112 [2019-09-03 19:53:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,394 INFO L225 Difference]: With dead ends: 744 [2019-09-03 19:53:45,394 INFO L226 Difference]: Without dead ends: 697 [2019-09-03 19:53:45,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2897 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=7601, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:53:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-03 19:53:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 140. [2019-09-03 19:53:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 19:53:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-03 19:53:45,527 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-03 19:53:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,527 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-03 19:53:45,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:53:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-03 19:53:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:53:45,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,528 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,528 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2041989135, now seen corresponding path program 12 times [2019-09-03 19:53:45,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:45,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:45,837 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:45,877 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:53:45,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:45,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:46,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2019-09-03 19:53:46,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:53:46,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:53:46,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:53:46,302 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 46 states. [2019-09-03 19:53:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:48,523 INFO L93 Difference]: Finished difference Result 787 states and 997 transitions. [2019-09-03 19:53:48,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:53:48,524 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 112 [2019-09-03 19:53:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:48,525 INFO L225 Difference]: With dead ends: 787 [2019-09-03 19:53:48,525 INFO L226 Difference]: Without dead ends: 740 [2019-09-03 19:53:48,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2060 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1403, Invalid=5907, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:53:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-03 19:53:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 142. [2019-09-03 19:53:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 19:53:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2019-09-03 19:53:48,661 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 112 [2019-09-03 19:53:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:48,661 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2019-09-03 19:53:48,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:53:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2019-09-03 19:53:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-03 19:53:48,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:48,662 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:48,662 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:48,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash -139002137, now seen corresponding path program 24 times [2019-09-03 19:53:48,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:48,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:48,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:48,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:48,803 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:48,842 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:53:48,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:48,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:53:48,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:48,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:53:48,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:48,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-03 19:53:48,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:53:48,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:53:48,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:53:48,877 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 20 states. [2019-09-03 19:53:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:49,234 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2019-09-03 19:53:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:53:49,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2019-09-03 19:53:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:49,236 INFO L225 Difference]: With dead ends: 155 [2019-09-03 19:53:49,236 INFO L226 Difference]: Without dead ends: 153 [2019-09-03 19:53:49,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:53:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-03 19:53:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2019-09-03 19:53:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 19:53:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2019-09-03 19:53:49,368 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 113 [2019-09-03 19:53:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:49,368 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2019-09-03 19:53:49,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:53:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2019-09-03 19:53:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:53:49,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:49,369 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:49,369 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash -264047376, now seen corresponding path program 25 times [2019-09-03 19:53:49,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:49,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:49,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:49,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:49,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:49,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:49,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:53:49,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:50,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:50,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 62 [2019-09-03 19:53:50,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:53:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:53:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=3029, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:53:50,523 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 62 states. [2019-09-03 19:53:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:51,671 INFO L93 Difference]: Finished difference Result 255 states and 299 transitions. [2019-09-03 19:53:51,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:53:51,671 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-09-03 19:53:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:51,672 INFO L225 Difference]: With dead ends: 255 [2019-09-03 19:53:51,672 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 19:53:51,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2634 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1593, Invalid=6779, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:53:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 19:53:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 150. [2019-09-03 19:53:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:53:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:53:51,811 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:53:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:51,811 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:53:51,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:53:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:53:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:53:51,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:51,812 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:51,812 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1127772817, now seen corresponding path program 67 times [2019-09-03 19:53:51,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:51,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:52,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:52,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:52,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:52,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:53:52,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:52,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:52,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 61 [2019-09-03 19:53:52,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:53:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:53:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=2949, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:53:52,940 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 61 states. [2019-09-03 19:53:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:54,977 INFO L93 Difference]: Finished difference Result 310 states and 369 transitions. [2019-09-03 19:53:54,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:53:54,978 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-09-03 19:53:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:54,979 INFO L225 Difference]: With dead ends: 310 [2019-09-03 19:53:54,979 INFO L226 Difference]: Without dead ends: 260 [2019-09-03 19:53:54,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3449 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=8759, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:53:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-03 19:53:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 150. [2019-09-03 19:53:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:53:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:53:55,128 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:53:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:55,128 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:53:55,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:53:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:53:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:53:55,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:55,129 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:55,129 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1155634928, now seen corresponding path program 68 times [2019-09-03 19:53:55,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:55,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:55,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:55,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:55,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:55,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:55,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:55,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:55,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:55,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:55,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:53:55,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:56,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:56,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 60 [2019-09-03 19:53:56,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:53:56,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:53:56,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=2867, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:53:56,314 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 60 states. [2019-09-03 19:53:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:58,506 INFO L93 Difference]: Finished difference Result 364 states and 438 transitions. [2019-09-03 19:53:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:53:58,507 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2019-09-03 19:53:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:58,508 INFO L225 Difference]: With dead ends: 364 [2019-09-03 19:53:58,508 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 19:53:58,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2308, Invalid=10574, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 19:53:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 19:53:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 150. [2019-09-03 19:53:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:53:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:53:58,664 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:53:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:58,665 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:53:58,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:53:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:53:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:53:58,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:58,665 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:58,665 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:58,666 INFO L82 PathProgramCache]: Analyzing trace with hash -325249713, now seen corresponding path program 69 times [2019-09-03 19:53:58,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:58,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:58,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:59,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:59,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:59,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:59,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 19:53:59,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:59,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:53:59,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:53:59,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:59,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 59 [2019-09-03 19:53:59,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:53:59,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:53:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=2783, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:53:59,757 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 59 states. [2019-09-03 19:54:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:02,352 INFO L93 Difference]: Finished difference Result 417 states and 506 transitions. [2019-09-03 19:54:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:54:02,352 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 120 [2019-09-03 19:54:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:02,353 INFO L225 Difference]: With dead ends: 417 [2019-09-03 19:54:02,353 INFO L226 Difference]: Without dead ends: 367 [2019-09-03 19:54:02,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4966 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=12134, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:54:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-03 19:54:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 150. [2019-09-03 19:54:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:02,521 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:02,521 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:02,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:54:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:02,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:02,522 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:02,522 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:02,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash 948462896, now seen corresponding path program 70 times [2019-09-03 19:54:02,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:02,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:02,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:02,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:02,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:02,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:02,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:02,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:02,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:02,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:03,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 58 [2019-09-03 19:54:03,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:54:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:54:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=2697, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:54:03,601 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 58 states. [2019-09-03 19:54:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:06,129 INFO L93 Difference]: Finished difference Result 469 states and 573 transitions. [2019-09-03 19:54:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:54:06,129 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-03 19:54:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:06,130 INFO L225 Difference]: With dead ends: 469 [2019-09-03 19:54:06,130 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 19:54:06,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5556 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2889, Invalid=13367, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 19:54:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 19:54:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 150. [2019-09-03 19:54:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:06,289 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:06,290 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:06,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:54:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:06,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:06,290 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:06,290 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash 435361071, now seen corresponding path program 71 times [2019-09-03 19:54:06,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:06,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:06,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:06,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:06,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:06,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:06,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:06,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:06,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-03 19:54:06,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:06,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:06,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (109)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:07,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:07,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 57 [2019-09-03 19:54:07,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:54:07,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:54:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2609, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:54:07,355 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 57 states. [2019-09-03 19:54:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:10,240 INFO L93 Difference]: Finished difference Result 520 states and 639 transitions. [2019-09-03 19:54:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:54:10,240 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 120 [2019-09-03 19:54:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:10,241 INFO L225 Difference]: With dead ends: 520 [2019-09-03 19:54:10,241 INFO L226 Difference]: Without dead ends: 470 [2019-09-03 19:54:10,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5979 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3073, Invalid=14219, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 19:54:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-03 19:54:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 150. [2019-09-03 19:54:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:10,410 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:10,411 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:10,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:54:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:10,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:10,411 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:10,411 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1250093392, now seen corresponding path program 72 times [2019-09-03 19:54:10,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:10,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:10,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:10,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:10,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:10,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:10,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:10,867 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:10,913 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-03 19:54:10,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:10,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:10,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:11,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:11,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 56 [2019-09-03 19:54:11,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:54:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:54:11,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:54:11,524 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 56 states. [2019-09-03 19:54:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:14,496 INFO L93 Difference]: Finished difference Result 570 states and 704 transitions. [2019-09-03 19:54:14,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:54:14,496 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 120 [2019-09-03 19:54:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:14,497 INFO L225 Difference]: With dead ends: 570 [2019-09-03 19:54:14,497 INFO L226 Difference]: Without dead ends: 520 [2019-09-03 19:54:14,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6209 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3168, Invalid=14654, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 19:54:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-03 19:54:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 150. [2019-09-03 19:54:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:14,662 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:14,662 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:14,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:54:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:14,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:14,663 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:14,663 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash 445091087, now seen corresponding path program 73 times [2019-09-03 19:54:14,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:15,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:15,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:15,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:15,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:15,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:15,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:15,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 55 [2019-09-03 19:54:15,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:54:15,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:54:15,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:54:15,682 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 55 states. [2019-09-03 19:54:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:19,246 INFO L93 Difference]: Finished difference Result 619 states and 768 transitions. [2019-09-03 19:54:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:54:19,246 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 120 [2019-09-03 19:54:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:19,248 INFO L225 Difference]: With dead ends: 619 [2019-09-03 19:54:19,248 INFO L226 Difference]: Without dead ends: 569 [2019-09-03 19:54:19,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6232 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3168, Invalid=14654, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 19:54:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-03 19:54:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 150. [2019-09-03 19:54:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:19,442 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:19,442 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:19,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:54:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:19,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:19,443 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:19,443 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1804596592, now seen corresponding path program 74 times [2019-09-03 19:54:19,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:19,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:19,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:19,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:19,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:19,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:19,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:19,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:19,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:19,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:19,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:20,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:20,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 54 [2019-09-03 19:54:20,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:54:20,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:54:20,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:54:20,446 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 54 states. [2019-09-03 19:54:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:23,930 INFO L93 Difference]: Finished difference Result 667 states and 831 transitions. [2019-09-03 19:54:23,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:54:23,931 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 120 [2019-09-03 19:54:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:23,932 INFO L225 Difference]: With dead ends: 667 [2019-09-03 19:54:23,932 INFO L226 Difference]: Without dead ends: 617 [2019-09-03 19:54:23,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6042 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3073, Invalid=14219, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 19:54:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-03 19:54:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 150. [2019-09-03 19:54:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:24,128 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:24,128 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:24,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:54:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:24,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:24,129 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:24,129 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:24,130 INFO L82 PathProgramCache]: Analyzing trace with hash 462978287, now seen corresponding path program 75 times [2019-09-03 19:54:24,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:24,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:24,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:24,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:24,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:24,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:24,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:24,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:24,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 19:54:24,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:24,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:24,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:25,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:25,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 53 [2019-09-03 19:54:25,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:54:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:54:25,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=2237, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:54:25,107 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 53 states. [2019-09-03 19:54:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:28,529 INFO L93 Difference]: Finished difference Result 714 states and 893 transitions. [2019-09-03 19:54:28,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:54:28,530 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 120 [2019-09-03 19:54:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:28,531 INFO L225 Difference]: With dead ends: 714 [2019-09-03 19:54:28,531 INFO L226 Difference]: Without dead ends: 664 [2019-09-03 19:54:28,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5641 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2889, Invalid=13367, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 19:54:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-03 19:54:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 150. [2019-09-03 19:54:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:28,714 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:28,714 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:28,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:54:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:28,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:28,715 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:28,715 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash -827225712, now seen corresponding path program 76 times [2019-09-03 19:54:28,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:28,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:28,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:29,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:29,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:29,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:29,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:29,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:29,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:29,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:29,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:29,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 52 [2019-09-03 19:54:29,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:54:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:54:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=2139, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:29,659 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 52 states. [2019-09-03 19:54:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:33,132 INFO L93 Difference]: Finished difference Result 760 states and 954 transitions. [2019-09-03 19:54:33,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:54:33,133 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-09-03 19:54:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:33,134 INFO L225 Difference]: With dead ends: 760 [2019-09-03 19:54:33,134 INFO L226 Difference]: Without dead ends: 710 [2019-09-03 19:54:33,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5043 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=12134, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:54:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-03 19:54:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 150. [2019-09-03 19:54:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:33,333 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:33,334 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:33,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:54:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:33,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:33,334 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:33,334 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2115771185, now seen corresponding path program 77 times [2019-09-03 19:54:33,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:33,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:33,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:33,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:33,690 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:33,736 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-03 19:54:33,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:33,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:33,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:34,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:34,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 51 [2019-09-03 19:54:34,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:54:34,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:54:34,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=2039, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:54:34,260 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 51 states. [2019-09-03 19:54:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:37,639 INFO L93 Difference]: Finished difference Result 805 states and 1014 transitions. [2019-09-03 19:54:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:54:37,640 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 120 [2019-09-03 19:54:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:37,641 INFO L225 Difference]: With dead ends: 805 [2019-09-03 19:54:37,642 INFO L226 Difference]: Without dead ends: 755 [2019-09-03 19:54:37,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2308, Invalid=10574, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 19:54:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-03 19:54:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 150. [2019-09-03 19:54:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:37,853 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:37,853 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:37,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:54:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:37,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:37,854 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:37,854 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2137630128, now seen corresponding path program 78 times [2019-09-03 19:54:37,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:37,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:38,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:38,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:38,243 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:38,288 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-03 19:54:38,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:38,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:38,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:38,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:38,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 50 [2019-09-03 19:54:38,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:54:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:54:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1937, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:54:38,767 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 50 states. [2019-09-03 19:54:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:41,996 INFO L93 Difference]: Finished difference Result 849 states and 1073 transitions. [2019-09-03 19:54:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:54:41,996 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 120 [2019-09-03 19:54:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:42,000 INFO L225 Difference]: With dead ends: 849 [2019-09-03 19:54:42,000 INFO L226 Difference]: Without dead ends: 799 [2019-09-03 19:54:42,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=8759, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:54:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-09-03 19:54:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 150. [2019-09-03 19:54:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:54:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-03 19:54:42,323 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-03 19:54:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:42,324 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-03 19:54:42,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:54:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-03 19:54:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:54:42,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:42,325 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:42,325 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash -911752017, now seen corresponding path program 13 times [2019-09-03 19:54:42,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:42,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:42,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:42,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:42,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:42,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:42,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:42,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:54:42,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:43,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:43,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2019-09-03 19:54:43,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:54:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:54:43,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1833, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:54:43,224 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 49 states. [2019-09-03 19:54:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:46,308 INFO L93 Difference]: Finished difference Result 895 states and 1135 transitions. [2019-09-03 19:54:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:54:46,308 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 120 [2019-09-03 19:54:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:46,310 INFO L225 Difference]: With dead ends: 895 [2019-09-03 19:54:46,310 INFO L226 Difference]: Without dead ends: 845 [2019-09-03 19:54:46,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1593, Invalid=6779, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:54:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-03 19:54:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 152. [2019-09-03 19:54:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 19:54:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-09-03 19:54:46,566 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 120 [2019-09-03 19:54:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:46,567 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-09-03 19:54:46,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:54:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-09-03 19:54:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 19:54:46,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:46,568 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:46,568 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1106115448, now seen corresponding path program 26 times [2019-09-03 19:54:46,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:46,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:46,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:46,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:46,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:46,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:46,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:46,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:46,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:54:46,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:54:46,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:46,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-09-03 19:54:46,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:54:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:54:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:54:46,831 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 21 states. [2019-09-03 19:54:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:47,243 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2019-09-03 19:54:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:54:47,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2019-09-03 19:54:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:47,245 INFO L225 Difference]: With dead ends: 165 [2019-09-03 19:54:47,245 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 19:54:47,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:54:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 19:54:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-03 19:54:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 19:54:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2019-09-03 19:54:47,570 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 121 [2019-09-03 19:54:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:47,570 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2019-09-03 19:54:47,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:54:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2019-09-03 19:54:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:54:47,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:47,571 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:47,571 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:47,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash 403015727, now seen corresponding path program 27 times [2019-09-03 19:54:47,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:47,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:47,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:47,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:48,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:48,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:54:48,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:48,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:48,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 66 [2019-09-03 19:54:48,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:54:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:54:48,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=3439, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:54:48,899 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand 66 states. [2019-09-03 19:54:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:50,808 INFO L93 Difference]: Finished difference Result 272 states and 319 transitions. [2019-09-03 19:54:50,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:54:50,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-09-03 19:54:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:50,809 INFO L225 Difference]: With dead ends: 272 [2019-09-03 19:54:50,809 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 19:54:50,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1795, Invalid=7711, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:54:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 19:54:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 160. [2019-09-03 19:54:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:54:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:54:51,025 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:54:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:51,025 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:54:51,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:54:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:54:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:54:51,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:51,026 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:51,026 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:51,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1348809134, now seen corresponding path program 79 times [2019-09-03 19:54:51,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:51,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:51,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:51,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:51,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:51,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:51,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:54:51,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:52,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:52,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2019-09-03 19:54:52,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:54:52,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:54:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=3354, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:54:52,250 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 65 states. [2019-09-03 19:54:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:54,170 INFO L93 Difference]: Finished difference Result 331 states and 394 transitions. [2019-09-03 19:54:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:54:54,170 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-09-03 19:54:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:54,171 INFO L225 Difference]: With dead ends: 331 [2019-09-03 19:54:54,171 INFO L226 Difference]: Without dead ends: 278 [2019-09-03 19:54:54,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3973 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=9999, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:54:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-03 19:54:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 160. [2019-09-03 19:54:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:54:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:54:54,389 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:54:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:54,389 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:54:54,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:54:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:54:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:54:54,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:54,390 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:54,390 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1656413263, now seen corresponding path program 80 times [2019-09-03 19:54:54,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:54,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:54,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:54,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:54,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:54,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:54,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:54,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:54:54,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:55,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:55,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 64 [2019-09-03 19:54:55,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:54:55,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:54:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3267, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:54:55,632 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 64 states. [2019-09-03 19:54:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:58,131 INFO L93 Difference]: Finished difference Result 389 states and 468 transitions. [2019-09-03 19:54:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:54:58,132 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2019-09-03 19:54:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:58,132 INFO L225 Difference]: With dead ends: 389 [2019-09-03 19:54:58,133 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 19:54:58,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4917 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2629, Invalid=12133, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:54:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 19:54:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 160. [2019-09-03 19:54:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:54:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:54:58,374 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:54:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:58,374 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:54:58,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:54:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:54:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:54:58,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:58,375 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:58,375 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:58,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1381705330, now seen corresponding path program 81 times [2019-09-03 19:54:58,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:58,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:58,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:58,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:54:58,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:58,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:54:58,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:58,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:54:58,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:54:59,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:59,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 63 [2019-09-03 19:54:59,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:54:59,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:54:59,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=3178, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:54:59,671 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 63 states. [2019-09-03 19:55:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:02,809 INFO L93 Difference]: Finished difference Result 446 states and 541 transitions. [2019-09-03 19:55:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 19:55:02,809 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 128 [2019-09-03 19:55:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:02,810 INFO L225 Difference]: With dead ends: 446 [2019-09-03 19:55:02,810 INFO L226 Difference]: Without dead ends: 393 [2019-09-03 19:55:02,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5789 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3016, Invalid=14014, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 19:55:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-03 19:55:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 160. [2019-09-03 19:55:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:03,040 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:03,041 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:03,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:55:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:03,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:03,041 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:03,041 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1291237487, now seen corresponding path program 82 times [2019-09-03 19:55:03,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:03,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:03,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:03,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:03,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:03,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:03,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:03,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:04,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:04,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 62 [2019-09-03 19:55:04,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:55:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:55:04,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=3087, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:55:04,245 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 62 states. [2019-09-03 19:55:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:07,787 INFO L93 Difference]: Finished difference Result 502 states and 613 transitions. [2019-09-03 19:55:07,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:55:07,787 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-03 19:55:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:07,791 INFO L225 Difference]: With dead ends: 502 [2019-09-03 19:55:07,791 INFO L226 Difference]: Without dead ends: 449 [2019-09-03 19:55:07,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3345, Invalid=15561, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 19:55:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-03 19:55:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 160. [2019-09-03 19:55:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:08,157 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:08,158 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:08,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:55:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:08,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:08,158 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:08,158 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:08,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1670579858, now seen corresponding path program 83 times [2019-09-03 19:55:08,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:08,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:08,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:08,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:08,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:08,549 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:08,592 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-03 19:55:08,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:08,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:08,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:09,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:09,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 61 [2019-09-03 19:55:09,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:55:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:55:09,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=2994, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:55:09,287 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 61 states. [2019-09-03 19:55:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:13,232 INFO L93 Difference]: Finished difference Result 557 states and 684 transitions. [2019-09-03 19:55:13,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 19:55:13,233 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 128 [2019-09-03 19:55:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:13,234 INFO L225 Difference]: With dead ends: 557 [2019-09-03 19:55:13,234 INFO L226 Difference]: Without dead ends: 504 [2019-09-03 19:55:13,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3595, Invalid=16711, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 19:55:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-03 19:55:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 160. [2019-09-03 19:55:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:13,468 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:13,468 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:13,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:55:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:13,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:13,469 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:13,469 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1766122353, now seen corresponding path program 84 times [2019-09-03 19:55:13,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:13,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:13,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:13,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:13,892 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:13,940 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-03 19:55:13,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:13,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:13,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:14,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:14,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 60 [2019-09-03 19:55:14,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:55:14,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:55:14,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=2899, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:55:14,618 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 60 states. [2019-09-03 19:55:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:18,754 INFO L93 Difference]: Finished difference Result 611 states and 754 transitions. [2019-09-03 19:55:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:55:18,754 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 128 [2019-09-03 19:55:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:18,755 INFO L225 Difference]: With dead ends: 611 [2019-09-03 19:55:18,755 INFO L226 Difference]: Without dead ends: 558 [2019-09-03 19:55:18,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7473 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3751, Invalid=17419, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 19:55:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-03 19:55:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 160. [2019-09-03 19:55:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:18,991 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:18,991 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:18,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:55:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:18,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:18,992 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:18,992 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1417384270, now seen corresponding path program 85 times [2019-09-03 19:55:18,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:18,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:19,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:19,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:19,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:19,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:19,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:20,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 59 [2019-09-03 19:55:20,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:55:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:55:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=2802, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:55:20,118 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 59 states. [2019-09-03 19:55:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:24,175 INFO L93 Difference]: Finished difference Result 664 states and 823 transitions. [2019-09-03 19:55:24,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 19:55:24,176 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-09-03 19:55:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:24,177 INFO L225 Difference]: With dead ends: 664 [2019-09-03 19:55:24,177 INFO L226 Difference]: Without dead ends: 611 [2019-09-03 19:55:24,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7617 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3804, Invalid=17658, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 19:55:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-03 19:55:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 160. [2019-09-03 19:55:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:24,434 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:24,434 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:24,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:55:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:24,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:24,435 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:24,436 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:24,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash 411699375, now seen corresponding path program 86 times [2019-09-03 19:55:24,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:24,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:24,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:24,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:24,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:24,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:24,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:24,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:24,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:25,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:25,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 58 [2019-09-03 19:55:25,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:55:25,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:55:25,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=2703, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:55:25,514 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 58 states. [2019-09-03 19:55:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:29,917 INFO L93 Difference]: Finished difference Result 716 states and 891 transitions. [2019-09-03 19:55:29,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:55:29,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 128 [2019-09-03 19:55:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:29,919 INFO L225 Difference]: With dead ends: 716 [2019-09-03 19:55:29,919 INFO L226 Difference]: Without dead ends: 663 [2019-09-03 19:55:29,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7528 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3751, Invalid=17419, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 19:55:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-03 19:55:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 160. [2019-09-03 19:55:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:30,162 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:30,162 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:30,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:55:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:30,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:30,163 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:30,163 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash -452026066, now seen corresponding path program 87 times [2019-09-03 19:55:30,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:30,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:30,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:30,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:30,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:30,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:30,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:55:30,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:30,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:30,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:31,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:31,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 57 [2019-09-03 19:55:31,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:55:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:55:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:55:31,278 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 57 states. [2019-09-03 19:55:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:35,744 INFO L93 Difference]: Finished difference Result 767 states and 958 transitions. [2019-09-03 19:55:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 19:55:35,744 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 128 [2019-09-03 19:55:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:35,745 INFO L225 Difference]: With dead ends: 767 [2019-09-03 19:55:35,745 INFO L226 Difference]: Without dead ends: 714 [2019-09-03 19:55:35,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7203 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3595, Invalid=16711, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 19:55:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-03 19:55:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 160. [2019-09-03 19:55:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:35,987 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:35,988 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:35,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:55:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:35,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:35,988 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:35,988 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:35,989 INFO L82 PathProgramCache]: Analyzing trace with hash -479888177, now seen corresponding path program 88 times [2019-09-03 19:55:35,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:35,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:35,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:36,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:36,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:36,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:36,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:36,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:36,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:36,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:37,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:37,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 56 [2019-09-03 19:55:37,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:55:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:55:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=2499, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:55:37,122 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 56 states. [2019-09-03 19:55:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:41,484 INFO L93 Difference]: Finished difference Result 817 states and 1024 transitions. [2019-09-03 19:55:41,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:55:41,484 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 128 [2019-09-03 19:55:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:41,485 INFO L225 Difference]: With dead ends: 817 [2019-09-03 19:55:41,485 INFO L226 Difference]: Without dead ends: 764 [2019-09-03 19:55:41,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6650 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3345, Invalid=15561, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 19:55:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-03 19:55:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 160. [2019-09-03 19:55:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:41,735 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:41,735 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:41,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:55:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:41,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:41,736 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:41,736 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:41,737 INFO L82 PathProgramCache]: Analyzing trace with hash 350497038, now seen corresponding path program 89 times [2019-09-03 19:55:41,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:41,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:41,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:42,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:42,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:42,127 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:42,173 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-03 19:55:42,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:42,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:42,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:42,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 55 [2019-09-03 19:55:42,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:55:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:55:42,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=2394, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:55:42,764 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 55 states. [2019-09-03 19:55:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:47,112 INFO L93 Difference]: Finished difference Result 866 states and 1089 transitions. [2019-09-03 19:55:47,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 19:55:47,112 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 128 [2019-09-03 19:55:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:47,114 INFO L225 Difference]: With dead ends: 866 [2019-09-03 19:55:47,114 INFO L226 Difference]: Without dead ends: 813 [2019-09-03 19:55:47,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5889 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3016, Invalid=14014, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 19:55:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-03 19:55:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 160. [2019-09-03 19:55:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:47,367 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:47,368 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:47,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:55:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:47,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:47,368 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:47,368 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1624209647, now seen corresponding path program 90 times [2019-09-03 19:55:47,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:47,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:47,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:47,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:47,745 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:47,790 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-03 19:55:47,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:47,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:47,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:48,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:48,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 54 [2019-09-03 19:55:48,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:55:48,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:55:48,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:55:48,367 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 54 states. [2019-09-03 19:55:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:52,939 INFO L93 Difference]: Finished difference Result 914 states and 1153 transitions. [2019-09-03 19:55:52,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:55:52,939 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 128 [2019-09-03 19:55:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:52,941 INFO L225 Difference]: With dead ends: 914 [2019-09-03 19:55:52,941 INFO L226 Difference]: Without dead ends: 861 [2019-09-03 19:55:52,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4952 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2629, Invalid=12133, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:55:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-03 19:55:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 160. [2019-09-03 19:55:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:53,267 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:53,267 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:53,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:55:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:53,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:53,268 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:53,268 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1111107822, now seen corresponding path program 91 times [2019-09-03 19:55:53,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:53,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:53,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:53,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:53,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:53,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:53,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:53,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:53,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:54,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 53 [2019-09-03 19:55:54,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:55:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:55:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:55:54,353 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 53 states. [2019-09-03 19:55:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:58,538 INFO L93 Difference]: Finished difference Result 961 states and 1216 transitions. [2019-09-03 19:55:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 19:55:58,539 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 128 [2019-09-03 19:55:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:58,540 INFO L225 Difference]: With dead ends: 961 [2019-09-03 19:55:58,540 INFO L226 Difference]: Without dead ends: 908 [2019-09-03 19:55:58,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=9999, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:55:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-03 19:55:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 160. [2019-09-03 19:55:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:55:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:55:58,798 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-03 19:55:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:58,798 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:55:58,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:55:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:55:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:55:58,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:58,799 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:58,799 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1925840143, now seen corresponding path program 14 times [2019-09-03 19:55:58,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:58,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:58,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:59,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:59,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:59,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:59,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:59,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:59,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:55:59,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:55:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:59,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2019-09-03 19:55:59,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:55:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:55:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:55:59,834 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 52 states. [2019-09-03 19:56:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:03,877 INFO L93 Difference]: Finished difference Result 1010 states and 1282 transitions. [2019-09-03 19:56:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:56:03,877 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 128 [2019-09-03 19:56:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:03,879 INFO L225 Difference]: With dead ends: 1010 [2019-09-03 19:56:03,879 INFO L226 Difference]: Without dead ends: 957 [2019-09-03 19:56:03,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1795, Invalid=7711, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:56:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-09-03 19:56:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 162. [2019-09-03 19:56:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 19:56:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2019-09-03 19:56:04,169 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 128 [2019-09-03 19:56:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:04,169 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2019-09-03 19:56:04,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:56:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2019-09-03 19:56:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-03 19:56:04,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:04,170 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:04,170 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1309179961, now seen corresponding path program 28 times [2019-09-03 19:56:04,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:56:04,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:04,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:04,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:04,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:04,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:04,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:04,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:56:04,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:04,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-09-03 19:56:04,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:56:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:56:04,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:56:04,451 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand 22 states. [2019-09-03 19:56:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:05,030 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2019-09-03 19:56:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:56:05,030 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 129 [2019-09-03 19:56:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:05,031 INFO L225 Difference]: With dead ends: 175 [2019-09-03 19:56:05,031 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 19:56:05,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:56:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 19:56:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-09-03 19:56:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 19:56:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2019-09-03 19:56:05,287 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 129 [2019-09-03 19:56:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:05,287 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2019-09-03 19:56:05,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:56:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2019-09-03 19:56:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:05,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:05,288 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:05,288 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1451640816, now seen corresponding path program 29 times [2019-09-03 19:56:05,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:05,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:05,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:05,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:05,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:05,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:05,855 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:05,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:56:05,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:05,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:05,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:06,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:06,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 70 [2019-09-03 19:56:06,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:56:06,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:56:06,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=3875, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:56:06,822 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand 70 states. [2019-09-03 19:56:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:08,971 INFO L93 Difference]: Finished difference Result 289 states and 339 transitions. [2019-09-03 19:56:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:56:08,971 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-09-03 19:56:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:08,971 INFO L225 Difference]: With dead ends: 289 [2019-09-03 19:56:08,972 INFO L226 Difference]: Without dead ends: 233 [2019-09-03 19:56:08,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2009, Invalid=8703, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:56:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-03 19:56:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 170. [2019-09-03 19:56:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:09,272 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:09,272 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:09,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:56:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:09,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:09,273 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:09,273 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash -837586289, now seen corresponding path program 92 times [2019-09-03 19:56:09,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:09,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:09,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:09,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:09,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:09,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:09,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:09,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:09,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:09,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:10,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:10,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 69 [2019-09-03 19:56:10,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:56:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:56:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=3785, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:56:10,708 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 69 states. [2019-09-03 19:56:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:13,219 INFO L93 Difference]: Finished difference Result 352 states and 419 transitions. [2019-09-03 19:56:13,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:56:13,220 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-09-03 19:56:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:13,221 INFO L225 Difference]: With dead ends: 352 [2019-09-03 19:56:13,221 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 19:56:13,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2485, Invalid=11321, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:56:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 19:56:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 170. [2019-09-03 19:56:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:13,512 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:13,512 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:13,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:56:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:13,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:13,513 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:13,513 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1814621232, now seen corresponding path program 93 times [2019-09-03 19:56:13,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:13,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:13,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:13,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:13,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:13,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:13,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:13,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:13,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:56:13,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:13,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:13,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:14,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:14,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 68 [2019-09-03 19:56:14,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:56:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:56:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=3693, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:56:14,885 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 68 states. [2019-09-03 19:56:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:17,893 INFO L93 Difference]: Finished difference Result 414 states and 498 transitions. [2019-09-03 19:56:17,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:56:17,894 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2019-09-03 19:56:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:17,894 INFO L225 Difference]: With dead ends: 414 [2019-09-03 19:56:17,895 INFO L226 Difference]: Without dead ends: 358 [2019-09-03 19:56:17,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5636 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2971, Invalid=13799, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:56:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-03 19:56:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 170. [2019-09-03 19:56:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:18,233 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:18,234 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:18,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:56:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:18,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:18,234 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:18,235 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -593675665, now seen corresponding path program 94 times [2019-09-03 19:56:18,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:18,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:18,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:18,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:18,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:18,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:18,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:18,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:18,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:18,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:19,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:19,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 67 [2019-09-03 19:56:19,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:56:19,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:56:19,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=3599, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:56:19,519 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 67 states. [2019-09-03 19:56:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:22,992 INFO L93 Difference]: Finished difference Result 475 states and 576 transitions. [2019-09-03 19:56:22,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:56:22,992 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 136 [2019-09-03 19:56:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:22,993 INFO L225 Difference]: With dead ends: 475 [2019-09-03 19:56:22,993 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 19:56:22,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6675 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3431, Invalid=16029, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 19:56:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 19:56:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 170. [2019-09-03 19:56:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:23,302 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:23,302 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:23,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:56:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:23,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:23,302 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:23,303 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1129752656, now seen corresponding path program 95 times [2019-09-03 19:56:23,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:23,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:23,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:23,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:23,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:23,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:23,735 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:23,786 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:56:23,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:23,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:23,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:24,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:24,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 66 [2019-09-03 19:56:24,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:56:24,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:56:24,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=3503, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:56:24,585 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 66 states. [2019-09-03 19:56:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:28,568 INFO L93 Difference]: Finished difference Result 535 states and 653 transitions. [2019-09-03 19:56:28,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:56:28,569 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-03 19:56:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:28,569 INFO L225 Difference]: With dead ends: 535 [2019-09-03 19:56:28,570 INFO L226 Difference]: Without dead ends: 479 [2019-09-03 19:56:28,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7589 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3835, Invalid=17921, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:56:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-03 19:56:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 170. [2019-09-03 19:56:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:28,885 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:28,885 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:28,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:56:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:28,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:28,886 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:28,886 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2001241521, now seen corresponding path program 96 times [2019-09-03 19:56:28,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:28,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:29,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:29,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:29,407 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:56:29,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:29,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:29,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:30,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:30,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 65 [2019-09-03 19:56:30,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:56:30,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:56:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=3405, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:56:30,191 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 65 states. [2019-09-03 19:56:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:34,504 INFO L93 Difference]: Finished difference Result 594 states and 729 transitions. [2019-09-03 19:56:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:56:34,504 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 136 [2019-09-03 19:56:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:34,505 INFO L225 Difference]: With dead ends: 594 [2019-09-03 19:56:34,506 INFO L226 Difference]: Without dead ends: 538 [2019-09-03 19:56:34,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8328 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4159, Invalid=19403, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:56:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-03 19:56:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 170. [2019-09-03 19:56:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:34,834 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:34,834 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:34,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:56:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:34,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:34,835 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:34,835 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash -855315344, now seen corresponding path program 97 times [2019-09-03 19:56:34,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:34,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:35,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:35,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:35,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:35,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:35,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:36,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:36,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 64 [2019-09-03 19:56:36,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:56:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:56:36,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=3305, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:56:36,094 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 64 states. [2019-09-03 19:56:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:41,115 INFO L93 Difference]: Finished difference Result 652 states and 804 transitions. [2019-09-03 19:56:41,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 19:56:41,115 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 136 [2019-09-03 19:56:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:41,116 INFO L225 Difference]: With dead ends: 652 [2019-09-03 19:56:41,116 INFO L226 Difference]: Without dead ends: 596 [2019-09-03 19:56:41,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8854 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4385, Invalid=20421, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 19:56:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-03 19:56:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 170. [2019-09-03 19:56:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:41,438 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:41,438 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:41,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:56:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:41,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:41,439 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:41,439 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:41,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1814049327, now seen corresponding path program 98 times [2019-09-03 19:56:41,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:41,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:41,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:41,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:41,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:41,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:41,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:41,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:41,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:41,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:41,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:41,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:42,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:42,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 63 [2019-09-03 19:56:42,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:56:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:56:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=3203, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:56:42,701 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 63 states. [2019-09-03 19:56:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:47,851 INFO L93 Difference]: Finished difference Result 709 states and 878 transitions. [2019-09-03 19:56:47,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 19:56:47,851 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 136 [2019-09-03 19:56:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:47,852 INFO L225 Difference]: With dead ends: 709 [2019-09-03 19:56:47,853 INFO L226 Difference]: Without dead ends: 653 [2019-09-03 19:56:47,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9141 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4501, Invalid=20939, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:56:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-03 19:56:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 170. [2019-09-03 19:56:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:48,178 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:48,178 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:48,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:56:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:48,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:48,179 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:48,179 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:48,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:48,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1068873872, now seen corresponding path program 99 times [2019-09-03 19:56:48,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:48,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:48,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:48,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:48,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:48,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:48,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:48,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:48,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:56:48,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:48,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:48,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:49,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:49,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 62 [2019-09-03 19:56:49,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:56:49,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:56:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=3099, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:56:49,448 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 62 states. [2019-09-03 19:56:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:54,943 INFO L93 Difference]: Finished difference Result 765 states and 951 transitions. [2019-09-03 19:56:54,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 19:56:54,943 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 136 [2019-09-03 19:56:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:54,944 INFO L225 Difference]: With dead ends: 765 [2019-09-03 19:56:54,944 INFO L226 Difference]: Without dead ends: 709 [2019-09-03 19:56:54,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9175 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4501, Invalid=20939, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:56:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-03 19:56:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 170. [2019-09-03 19:56:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:56:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:56:55,275 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:56:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:55,275 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:56:55,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:56:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:56:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:55,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:55,276 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:55,276 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2014667279, now seen corresponding path program 100 times [2019-09-03 19:56:55,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:55,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:55,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:55,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:55,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:55,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:55,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:55,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:55,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:56:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:56,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 61 [2019-09-03 19:56:56,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:56:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:56:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=2993, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:56:56,422 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 61 states. [2019-09-03 19:57:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:02,026 INFO L93 Difference]: Finished difference Result 820 states and 1023 transitions. [2019-09-03 19:57:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 19:57:02,026 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 136 [2019-09-03 19:57:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:02,027 INFO L225 Difference]: With dead ends: 820 [2019-09-03 19:57:02,028 INFO L226 Difference]: Without dead ends: 764 [2019-09-03 19:57:02,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8950 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4385, Invalid=20421, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 19:57:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-03 19:57:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 170. [2019-09-03 19:57:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:57:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:57:02,361 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:57:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:02,362 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:57:02,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:57:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:57:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:57:02,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:02,362 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:02,362 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1972695888, now seen corresponding path program 101 times [2019-09-03 19:57:02,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:02,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:02,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:02,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:02,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:02,843 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:57:02,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:02,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:57:02,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:03,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 60 [2019-09-03 19:57:03,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:57:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:57:03,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=2885, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:57:03,559 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 60 states. [2019-09-03 19:57:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:09,270 INFO L93 Difference]: Finished difference Result 874 states and 1094 transitions. [2019-09-03 19:57:09,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 19:57:09,270 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 136 [2019-09-03 19:57:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:09,272 INFO L225 Difference]: With dead ends: 874 [2019-09-03 19:57:09,272 INFO L226 Difference]: Without dead ends: 818 [2019-09-03 19:57:09,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8468 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4159, Invalid=19403, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:57:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-09-03 19:57:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 170. [2019-09-03 19:57:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:57:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:57:09,620 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:57:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:09,620 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:57:09,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:57:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:57:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:57:09,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:09,621 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:09,621 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash -715847185, now seen corresponding path program 102 times [2019-09-03 19:57:09,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:09,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:09,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:09,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:10,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:10,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:10,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:10,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:57:10,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:10,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:57:10,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:10,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:10,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 59 [2019-09-03 19:57:10,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:57:10,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:57:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2775, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:57:10,769 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 59 states. [2019-09-03 19:57:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:16,375 INFO L93 Difference]: Finished difference Result 927 states and 1164 transitions. [2019-09-03 19:57:16,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 19:57:16,375 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 136 [2019-09-03 19:57:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:16,377 INFO L225 Difference]: With dead ends: 927 [2019-09-03 19:57:16,377 INFO L226 Difference]: Without dead ends: 871 [2019-09-03 19:57:16,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7743 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3835, Invalid=17921, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:57:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-09-03 19:57:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 170. [2019-09-03 19:57:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:57:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:57:16,738 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:57:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:16,738 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:57:16,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:57:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:57:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:57:16,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:16,739 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:16,739 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1957095632, now seen corresponding path program 103 times [2019-09-03 19:57:16,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:16,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:16,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:16,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:16,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:17,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:17,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:17,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:57:17,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:17,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:17,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 58 [2019-09-03 19:57:17,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:57:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:57:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:57:17,926 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 58 states. [2019-09-03 19:57:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:23,551 INFO L93 Difference]: Finished difference Result 979 states and 1233 transitions. [2019-09-03 19:57:23,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:57:23,552 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-09-03 19:57:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:23,553 INFO L225 Difference]: With dead ends: 979 [2019-09-03 19:57:23,553 INFO L226 Difference]: Without dead ends: 923 [2019-09-03 19:57:23,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6801 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3431, Invalid=16029, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 19:57:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-03 19:57:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 170. [2019-09-03 19:57:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:57:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:57:23,921 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:57:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:23,921 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:57:23,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:57:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:57:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:57:23,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:23,921 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:23,922 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:23,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1004721713, now seen corresponding path program 104 times [2019-09-03 19:57:23,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:23,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:24,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:24,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:24,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:24,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:24,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:24,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:57:24,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:24,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2019-09-03 19:57:24,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:57:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:57:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2549, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:57:24,979 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 57 states. [2019-09-03 19:57:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:30,596 INFO L93 Difference]: Finished difference Result 1030 states and 1301 transitions. [2019-09-03 19:57:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:57:30,596 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 136 [2019-09-03 19:57:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:30,597 INFO L225 Difference]: With dead ends: 1030 [2019-09-03 19:57:30,598 INFO L226 Difference]: Without dead ends: 974 [2019-09-03 19:57:30,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5680 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2971, Invalid=13799, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:57:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-03 19:57:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 170. [2019-09-03 19:57:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:57:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:57:30,952 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:57:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:30,952 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:57:30,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:57:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:57:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:57:30,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:30,953 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:30,953 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1100264208, now seen corresponding path program 105 times [2019-09-03 19:57:30,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:30,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:30,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:30,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:31,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:31,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:31,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:31,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:57:31,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:31,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:57:31,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:32,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:32,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 56 [2019-09-03 19:57:32,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:57:32,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:57:32,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2433, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:57:32,171 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 56 states. [2019-09-03 19:57:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:37,713 INFO L93 Difference]: Finished difference Result 1080 states and 1368 transitions. [2019-09-03 19:57:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:57:37,713 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 136 [2019-09-03 19:57:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:37,715 INFO L225 Difference]: With dead ends: 1080 [2019-09-03 19:57:37,715 INFO L226 Difference]: Without dead ends: 1024 [2019-09-03 19:57:37,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4430 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2485, Invalid=11321, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:57:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-09-03 19:57:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 170. [2019-09-03 19:57:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:57:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-03 19:57:38,073 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-03 19:57:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:38,074 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-03 19:57:38,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:57:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-03 19:57:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:57:38,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:38,074 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:38,074 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2083242415, now seen corresponding path program 15 times [2019-09-03 19:57:38,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:38,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:38,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:38,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:38,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:38,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:38,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:38,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:57:38,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:38,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:57:38,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:39,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:39,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2019-09-03 19:57:39,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:57:39,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:57:39,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=2315, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:57:39,156 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 55 states. [2019-09-03 19:57:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:44,437 INFO L93 Difference]: Finished difference Result 1132 states and 1438 transitions. [2019-09-03 19:57:44,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:57:44,438 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 136 [2019-09-03 19:57:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:44,439 INFO L225 Difference]: With dead ends: 1132 [2019-09-03 19:57:44,440 INFO L226 Difference]: Without dead ends: 1076 [2019-09-03 19:57:44,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3113 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2009, Invalid=8703, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:57:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-03 19:57:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 172. [2019-09-03 19:57:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-03 19:57:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2019-09-03 19:57:44,802 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 136 [2019-09-03 19:57:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:44,802 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2019-09-03 19:57:44,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:57:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2019-09-03 19:57:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 19:57:44,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:44,803 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:44,803 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash -769222744, now seen corresponding path program 30 times [2019-09-03 19:57:44,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:45,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:45,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:45,035 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:45,086 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:57:45,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:45,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:57:45,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:45,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:57:45,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:45,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-03 19:57:45,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:57:45,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:57:45,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:57:45,136 INFO L87 Difference]: Start difference. First operand 172 states and 190 transitions. Second operand 23 states. [2019-09-03 19:57:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:45,765 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2019-09-03 19:57:45,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:57:45,765 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2019-09-03 19:57:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:45,766 INFO L225 Difference]: With dead ends: 185 [2019-09-03 19:57:45,766 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 19:57:45,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:57:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 19:57:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2019-09-03 19:57:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 19:57:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-09-03 19:57:46,120 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 137 [2019-09-03 19:57:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:46,120 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-09-03 19:57:46,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:57:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-09-03 19:57:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:57:46,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:46,121 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:46,121 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:46,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1314599183, now seen corresponding path program 31 times [2019-09-03 19:57:46,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:46,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:46,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:46,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:57:46,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:46,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:46,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:46,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:57:46,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:57:47,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:47,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 74 [2019-09-03 19:57:47,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 19:57:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 19:57:47,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=4337, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:57:47,720 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 74 states. [2019-09-03 19:57:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:49,562 INFO L93 Difference]: Finished difference Result 306 states and 359 transitions. [2019-09-03 19:57:49,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:57:49,562 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-09-03 19:57:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:49,563 INFO L225 Difference]: With dead ends: 306 [2019-09-03 19:57:49,563 INFO L226 Difference]: Without dead ends: 247 [2019-09-03 19:57:49,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3888 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2235, Invalid=9755, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:57:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-03 19:57:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 180. [2019-09-03 19:57:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:57:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:57:49,957 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:57:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:49,958 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:57:49,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 19:57:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:57:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:57:49,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:49,958 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:49,958 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:49,959 INFO L82 PathProgramCache]: Analyzing trace with hash 277740686, now seen corresponding path program 106 times [2019-09-03 19:57:49,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:49,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:49,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:57:50,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:50,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:50,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:50,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:50,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:50,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:57:50,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:57:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 73 [2019-09-03 19:57:51,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 19:57:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 19:57:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1014, Invalid=4242, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:57:51,521 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 73 states. [2019-09-03 19:57:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:54,598 INFO L93 Difference]: Finished difference Result 373 states and 444 transitions. [2019-09-03 19:57:54,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:57:54,598 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-09-03 19:57:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:54,599 INFO L225 Difference]: With dead ends: 373 [2019-09-03 19:57:54,599 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 19:57:54,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5132 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=12725, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 19:57:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 19:57:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2019-09-03 19:57:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:57:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:57:55,008 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:57:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:55,008 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:57:55,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 19:57:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:57:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:57:55,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:55,009 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:55,009 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1629766959, now seen corresponding path program 107 times [2019-09-03 19:57:55,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:55,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:55,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:57:55,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:55,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:55,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:55,548 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-03 19:57:55,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:55,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:57:55,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:57:56,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:56,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 72 [2019-09-03 19:57:56,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:57:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:57:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=4145, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:57:56,487 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 72 states. [2019-09-03 19:58:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:00,503 INFO L93 Difference]: Finished difference Result 439 states and 528 transitions. [2019-09-03 19:58:00,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:58:00,503 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2019-09-03 19:58:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:00,504 INFO L225 Difference]: With dead ends: 439 [2019-09-03 19:58:00,504 INFO L226 Difference]: Without dead ends: 380 [2019-09-03 19:58:00,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6404 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3334, Invalid=15572, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 19:58:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-03 19:58:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 180. [2019-09-03 19:58:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:00,922 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:00,922 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:00,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:58:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:00,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:00,923 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:00,923 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:00,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1950475374, now seen corresponding path program 108 times [2019-09-03 19:58:00,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:00,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:00,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:01,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:01,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:01,457 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-03 19:58:01,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:01,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:01,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:02,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:02,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 71 [2019-09-03 19:58:02,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 19:58:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 19:58:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=924, Invalid=4046, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:58:02,359 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 71 states. [2019-09-03 19:58:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:06,990 INFO L93 Difference]: Finished difference Result 504 states and 611 transitions. [2019-09-03 19:58:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:58:06,990 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 144 [2019-09-03 19:58:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:06,991 INFO L225 Difference]: With dead ends: 504 [2019-09-03 19:58:06,991 INFO L226 Difference]: Without dead ends: 445 [2019-09-03 19:58:06,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7624 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3873, Invalid=18179, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 19:58:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-03 19:58:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 180. [2019-09-03 19:58:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:07,442 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:07,443 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:07,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 19:58:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:07,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:07,443 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:07,443 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:07,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2057051825, now seen corresponding path program 109 times [2019-09-03 19:58:07,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:07,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:07,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:08,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:08,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:08,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:08,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:08,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:08,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 70 [2019-09-03 19:58:09,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:58:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:58:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=3945, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:58:09,003 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 70 states. [2019-09-03 19:58:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:14,087 INFO L93 Difference]: Finished difference Result 568 states and 693 transitions. [2019-09-03 19:58:14,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:58:14,088 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-09-03 19:58:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:14,089 INFO L225 Difference]: With dead ends: 568 [2019-09-03 19:58:14,089 INFO L226 Difference]: Without dead ends: 509 [2019-09-03 19:58:14,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8724 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4359, Invalid=20447, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 19:58:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-03 19:58:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 180. [2019-09-03 19:58:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:14,527 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:14,527 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:14,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:58:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:14,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:14,528 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:14,528 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash -108116914, now seen corresponding path program 110 times [2019-09-03 19:58:14,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:14,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:15,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:15,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:15,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:15,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:15,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:15,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:15,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:15,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:15,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 69 [2019-09-03 19:58:15,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:58:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:58:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=3842, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:58:15,994 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 69 states. [2019-09-03 19:58:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:21,822 INFO L93 Difference]: Finished difference Result 631 states and 774 transitions. [2019-09-03 19:58:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 19:58:21,823 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 144 [2019-09-03 19:58:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:21,824 INFO L225 Difference]: With dead ends: 631 [2019-09-03 19:58:21,824 INFO L226 Difference]: Without dead ends: 572 [2019-09-03 19:58:21,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9648 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4765, Invalid=22295, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 19:58:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-03 19:58:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 180. [2019-09-03 19:58:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:22,269 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:22,269 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:22,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:58:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:22,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:22,270 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:22,270 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 924583279, now seen corresponding path program 111 times [2019-09-03 19:58:22,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:22,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:22,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:22,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:22,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 19:58:22,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:22,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:22,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:23,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:23,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 68 [2019-09-03 19:58:23,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:58:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:58:23,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3737, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:58:23,737 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 68 states. [2019-09-03 19:58:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:29,943 INFO L93 Difference]: Finished difference Result 693 states and 854 transitions. [2019-09-03 19:58:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 19:58:29,944 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 144 [2019-09-03 19:58:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:29,945 INFO L225 Difference]: With dead ends: 693 [2019-09-03 19:58:29,945 INFO L226 Difference]: Without dead ends: 634 [2019-09-03 19:58:29,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10352 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5070, Invalid=23660, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 19:58:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-03 19:58:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 180. [2019-09-03 19:58:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:30,387 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:30,387 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:30,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:58:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:30,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:30,388 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:30,388 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1674503122, now seen corresponding path program 112 times [2019-09-03 19:58:30,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:30,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:30,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:30,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:31,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:31,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:31,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:31,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:31,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:31,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 67 [2019-09-03 19:58:31,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:58:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:58:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=3630, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:58:31,856 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 67 states. [2019-09-03 19:58:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:38,220 INFO L93 Difference]: Finished difference Result 754 states and 933 transitions. [2019-09-03 19:58:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 19:58:38,221 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 144 [2019-09-03 19:58:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:38,222 INFO L225 Difference]: With dead ends: 754 [2019-09-03 19:58:38,222 INFO L226 Difference]: Without dead ends: 695 [2019-09-03 19:58:38,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5259, Invalid=24497, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 19:58:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-03 19:58:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 180. [2019-09-03 19:58:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:38,700 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:38,700 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:38,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:58:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:38,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:38,701 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:38,701 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash 181318031, now seen corresponding path program 113 times [2019-09-03 19:58:38,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:38,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:38,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:38,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:38,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:39,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:39,244 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:39,305 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-03 19:58:39,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:39,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:39,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:40,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:40,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 66 [2019-09-03 19:58:40,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:58:40,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:58:40,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=769, Invalid=3521, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:58:40,104 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 66 states. [2019-09-03 19:58:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:47,237 INFO L93 Difference]: Finished difference Result 814 states and 1011 transitions. [2019-09-03 19:58:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 19:58:47,237 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 144 [2019-09-03 19:58:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:47,238 INFO L225 Difference]: With dead ends: 814 [2019-09-03 19:58:47,239 INFO L226 Difference]: Without dead ends: 755 [2019-09-03 19:58:47,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10984 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5323, Invalid=24779, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 19:58:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-03 19:58:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 180. [2019-09-03 19:58:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:47,691 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:47,691 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:47,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:58:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:47,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:47,692 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:47,692 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash 795372558, now seen corresponding path program 114 times [2019-09-03 19:58:47,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:47,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:47,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:48,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:48,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:48,317 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-03 19:58:48,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:48,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:48,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:49,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:49,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 65 [2019-09-03 19:58:49,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:58:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:58:49,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=3410, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:58:49,102 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 65 states. [2019-09-03 19:58:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:56,096 INFO L93 Difference]: Finished difference Result 873 states and 1088 transitions. [2019-09-03 19:58:56,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-03 19:58:56,097 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 144 [2019-09-03 19:58:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:56,098 INFO L225 Difference]: With dead ends: 873 [2019-09-03 19:58:56,098 INFO L226 Difference]: Without dead ends: 814 [2019-09-03 19:58:56,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10883 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5259, Invalid=24497, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 19:58:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-03 19:58:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 180. [2019-09-03 19:58:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:58:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:58:56,554 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:58:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:56,554 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:58:56,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:58:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:58:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:58:56,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:56,555 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:56,555 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash -847387217, now seen corresponding path program 115 times [2019-09-03 19:58:56,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:56,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:56,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:56,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:56,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:57,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:57,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:57,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:57,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:58:57,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:58:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 64 [2019-09-03 19:58:57,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:58:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:58:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=3297, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:58:57,868 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 64 states. [2019-09-03 19:59:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:04,906 INFO L93 Difference]: Finished difference Result 931 states and 1164 transitions. [2019-09-03 19:59:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 19:59:04,906 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 144 [2019-09-03 19:59:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:04,907 INFO L225 Difference]: With dead ends: 931 [2019-09-03 19:59:04,907 INFO L226 Difference]: Without dead ends: 872 [2019-09-03 19:59:04,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10498 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5070, Invalid=23660, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 19:59:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-09-03 19:59:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 180. [2019-09-03 19:59:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:59:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:59:05,381 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:59:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:05,381 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:59:05,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:59:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:59:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:59:05,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:05,382 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:05,382 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:05,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1039283182, now seen corresponding path program 116 times [2019-09-03 19:59:05,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:05,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:05,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:05,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:05,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:05,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:05,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:05,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:05,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:05,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:05,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:59:05,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:06,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:06,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 63 [2019-09-03 19:59:06,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:59:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:59:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=3182, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:59:06,678 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 63 states. [2019-09-03 19:59:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:14,048 INFO L93 Difference]: Finished difference Result 988 states and 1239 transitions. [2019-09-03 19:59:14,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 19:59:14,048 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 144 [2019-09-03 19:59:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:14,049 INFO L225 Difference]: With dead ends: 988 [2019-09-03 19:59:14,050 INFO L226 Difference]: Without dead ends: 929 [2019-09-03 19:59:14,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9837 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4765, Invalid=22295, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 19:59:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-03 19:59:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 180. [2019-09-03 19:59:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:59:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:59:14,552 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:59:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:14,552 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:59:14,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:59:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:59:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:59:14,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:14,553 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:14,553 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1532255793, now seen corresponding path program 117 times [2019-09-03 19:59:14,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:14,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:14,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:14,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:14,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:15,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:15,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:15,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:15,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 19:59:15,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:15,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:59:15,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:15,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:15,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 62 [2019-09-03 19:59:15,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:59:15,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:59:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=3065, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:59:15,834 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 62 states. [2019-09-03 19:59:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:23,342 INFO L93 Difference]: Finished difference Result 1044 states and 1313 transitions. [2019-09-03 19:59:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 19:59:23,343 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 144 [2019-09-03 19:59:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:23,344 INFO L225 Difference]: With dead ends: 1044 [2019-09-03 19:59:23,344 INFO L226 Difference]: Without dead ends: 985 [2019-09-03 19:59:23,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8920 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4359, Invalid=20447, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 19:59:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-03 19:59:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 180. [2019-09-03 19:59:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:59:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:59:23,813 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:59:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:23,814 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:59:23,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:59:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:59:23,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:59:23,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:23,814 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:23,814 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:23,815 INFO L82 PathProgramCache]: Analyzing trace with hash -368282674, now seen corresponding path program 118 times [2019-09-03 19:59:23,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:23,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:23,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:23,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:24,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:24,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:24,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:24,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:24,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:24,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:59:24,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:25,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:25,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 61 [2019-09-03 19:59:25,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:59:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:59:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=2946, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:59:25,023 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 61 states. [2019-09-03 19:59:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:32,612 INFO L93 Difference]: Finished difference Result 1099 states and 1386 transitions. [2019-09-03 19:59:32,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 19:59:32,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 144 [2019-09-03 19:59:32,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:32,614 INFO L225 Difference]: With dead ends: 1099 [2019-09-03 19:59:32,614 INFO L226 Difference]: Without dead ends: 1040 [2019-09-03 19:59:32,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7779 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3873, Invalid=18179, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 19:59:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-09-03 19:59:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 180. [2019-09-03 19:59:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:59:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:59:33,096 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:59:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:33,097 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:59:33,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:59:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:59:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:59:33,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:33,097 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:33,097 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash 777643503, now seen corresponding path program 119 times [2019-09-03 19:59:33,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:33,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:33,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:33,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:33,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:33,683 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:33,734 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-03 19:59:33,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:33,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:59:33,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:34,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2019-09-03 19:59:34,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:59:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:59:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:59:34,403 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 60 states. [2019-09-03 19:59:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:41,791 INFO L93 Difference]: Finished difference Result 1153 states and 1458 transitions. [2019-09-03 19:59:41,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:59:41,791 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 144 [2019-09-03 19:59:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:41,793 INFO L225 Difference]: With dead ends: 1153 [2019-09-03 19:59:41,793 INFO L226 Difference]: Without dead ends: 1094 [2019-09-03 19:59:41,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6458 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3334, Invalid=15572, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 19:59:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-09-03 19:59:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 180. [2019-09-03 19:59:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:59:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:59:42,277 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:59:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:42,277 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:59:42,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:59:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:59:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:59:42,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:42,278 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:42,278 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:42,278 INFO L82 PathProgramCache]: Analyzing trace with hash -847959122, now seen corresponding path program 120 times [2019-09-03 19:59:42,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:42,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:42,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:42,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:42,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:42,884 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:42,935 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-03 19:59:42,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:42,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:59:42,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:43,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:43,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 59 [2019-09-03 19:59:43,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:59:43,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:59:43,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=2702, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:59:43,620 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 59 states. [2019-09-03 19:59:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:50,831 INFO L93 Difference]: Finished difference Result 1206 states and 1529 transitions. [2019-09-03 19:59:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:59:50,831 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 144 [2019-09-03 19:59:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:50,833 INFO L225 Difference]: With dead ends: 1206 [2019-09-03 19:59:50,833 INFO L226 Difference]: Without dead ends: 1147 [2019-09-03 19:59:50,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5013 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2775, Invalid=12725, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 19:59:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-09-03 19:59:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 180. [2019-09-03 19:59:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:59:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-03 19:59:51,367 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-03 19:59:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:51,367 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-03 19:59:51,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:59:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-03 19:59:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:59:51,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:51,368 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:51,368 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:51,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:51,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1593134577, now seen corresponding path program 16 times [2019-09-03 19:59:51,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:51,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:51,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:51,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:51,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:51,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:51,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:51,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:51,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:59:51,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:59:52,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:52,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 58 [2019-09-03 19:59:52,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:59:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:59:52,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=2577, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:59:52,552 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 58 states. [2019-09-03 19:59:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:59,647 INFO L93 Difference]: Finished difference Result 1261 states and 1603 transitions. [2019-09-03 19:59:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:59:59,648 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 144 [2019-09-03 19:59:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:59,649 INFO L225 Difference]: With dead ends: 1261 [2019-09-03 19:59:59,649 INFO L226 Difference]: Without dead ends: 1202 [2019-09-03 19:59:59,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2235, Invalid=9755, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:59:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-03 20:00:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 182. [2019-09-03 20:00:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-03 20:00:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2019-09-03 20:00:00,139 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 144 [2019-09-03 20:00:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:00,139 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2019-09-03 20:00:00,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:00:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2019-09-03 20:00:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 20:00:00,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:00,140 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:00,140 INFO L418 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:00,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1336215385, now seen corresponding path program 32 times [2019-09-03 20:00:00,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:00,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:00,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:00,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:00,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:00:00,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:00,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:00,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:00,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:00,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:00,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:00,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:00,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:00:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:00,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-03 20:00:00,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:00:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:00:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:00:00,427 INFO L87 Difference]: Start difference. First operand 182 states and 201 transitions. Second operand 24 states. [2019-09-03 20:00:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:01,253 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2019-09-03 20:00:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:00:01,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 145 [2019-09-03 20:00:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:01,254 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:00:01,254 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 20:00:01,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:00:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 20:00:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2019-09-03 20:00:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 20:00:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2019-09-03 20:00:01,780 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 145 [2019-09-03 20:00:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:01,781 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2019-09-03 20:00:01,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:00:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2019-09-03 20:00:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:01,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:01,782 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:01,782 INFO L418 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1211727056, now seen corresponding path program 33 times [2019-09-03 20:00:01,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:01,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:01,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:02,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:02,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:02,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:02,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:00:02,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:02,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:02,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:03,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:03,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 78 [2019-09-03 20:00:03,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:00:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:00:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=4825, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:00:03,534 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand 78 states. [2019-09-03 20:00:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:06,491 INFO L93 Difference]: Finished difference Result 323 states and 379 transitions. [2019-09-03 20:00:06,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:00:06,491 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-09-03 20:00:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:06,492 INFO L225 Difference]: With dead ends: 323 [2019-09-03 20:00:06,492 INFO L226 Difference]: Without dead ends: 261 [2019-09-03 20:00:06,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4360 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2473, Invalid=10867, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:00:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-03 20:00:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 190. [2019-09-03 20:00:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:00:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:00:07,021 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:00:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:07,021 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:00:07,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:00:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:00:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:07,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:07,022 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:07,022 INFO L418 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:07,022 INFO L82 PathProgramCache]: Analyzing trace with hash -101621841, now seen corresponding path program 121 times [2019-09-03 20:00:07,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:07,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:07,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:07,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:07,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:07,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:07,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:08,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:08,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 77 [2019-09-03 20:00:08,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:00:08,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:00:08,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=4725, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:00:08,686 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 77 states. [2019-09-03 20:00:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:12,576 INFO L93 Difference]: Finished difference Result 394 states and 469 transitions. [2019-09-03 20:00:12,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:00:12,577 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-09-03 20:00:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:12,577 INFO L225 Difference]: With dead ends: 394 [2019-09-03 20:00:12,577 INFO L226 Difference]: Without dead ends: 332 [2019-09-03 20:00:12,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5767 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3081, Invalid=14211, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:00:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-03 20:00:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 190. [2019-09-03 20:00:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:00:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:00:13,126 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:00:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:13,126 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:00:13,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:00:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:00:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:13,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:13,127 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:13,127 INFO L418 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -758548656, now seen corresponding path program 122 times [2019-09-03 20:00:13,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:13,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:13,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:13,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:13,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:13,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:13,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:13,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:13,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:13,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:14,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:14,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 76 [2019-09-03 20:00:14,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:00:14,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:00:14,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1077, Invalid=4623, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:00:14,750 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 76 states. [2019-09-03 20:00:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:19,514 INFO L93 Difference]: Finished difference Result 464 states and 558 transitions. [2019-09-03 20:00:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:00:19,515 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2019-09-03 20:00:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:19,515 INFO L225 Difference]: With dead ends: 464 [2019-09-03 20:00:19,516 INFO L226 Difference]: Without dead ends: 402 [2019-09-03 20:00:19,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7221 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3718, Invalid=17452, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:00:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-03 20:00:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 190. [2019-09-03 20:00:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:00:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:00:20,101 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:00:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:20,101 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:00:20,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:00:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:00:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:20,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:20,102 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:20,102 INFO L418 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1991206799, now seen corresponding path program 123 times [2019-09-03 20:00:20,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:20,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:20,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:20,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:20,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:20,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:00:20,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:20,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:20,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:21,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:21,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 75 [2019-09-03 20:00:21,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:00:21,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:00:21,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=4519, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:00:21,740 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 75 states. [2019-09-03 20:00:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:26,896 INFO L93 Difference]: Finished difference Result 533 states and 646 transitions. [2019-09-03 20:00:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:00:26,897 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 152 [2019-09-03 20:00:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:26,897 INFO L225 Difference]: With dead ends: 533 [2019-09-03 20:00:26,897 INFO L226 Difference]: Without dead ends: 471 [2019-09-03 20:00:26,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8636 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4342, Invalid=20464, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:00:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-03 20:00:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 190. [2019-09-03 20:00:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:00:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:00:27,471 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:00:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:27,471 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:00:27,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:00:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:00:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:27,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:27,472 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:27,472 INFO L418 AbstractCegarLoop]: === Iteration 175 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2076511376, now seen corresponding path program 124 times [2019-09-03 20:00:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:27,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:28,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:28,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:28,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:28,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:28,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:28,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:28,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:29,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:29,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 74 [2019-09-03 20:00:29,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:00:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:00:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=4413, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:00:29,104 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 74 states. [2019-09-03 20:00:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:35,551 INFO L93 Difference]: Finished difference Result 601 states and 733 transitions. [2019-09-03 20:00:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:00:35,551 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-03 20:00:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:35,552 INFO L225 Difference]: With dead ends: 601 [2019-09-03 20:00:35,552 INFO L226 Difference]: Without dead ends: 539 [2019-09-03 20:00:35,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9938 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4917, Invalid=23139, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:00:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-03 20:00:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 190. [2019-09-03 20:00:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:00:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:00:36,140 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:00:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:36,140 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:00:36,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:00:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:00:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:36,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:36,141 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:36,141 INFO L418 AbstractCegarLoop]: === Iteration 176 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:36,141 INFO L82 PathProgramCache]: Analyzing trace with hash 286123887, now seen corresponding path program 125 times [2019-09-03 20:00:36,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:36,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:36,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:36,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:36,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:36,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:36,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:36,782 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:36,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 20:00:36,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:36,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:36,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:37,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:37,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 73 [2019-09-03 20:00:37,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:00:37,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:00:37,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=4305, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:00:37,782 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 73 states. [2019-09-03 20:00:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:44,716 INFO L93 Difference]: Finished difference Result 668 states and 819 transitions. [2019-09-03 20:00:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:00:44,717 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 152 [2019-09-03 20:00:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:44,718 INFO L225 Difference]: With dead ends: 668 [2019-09-03 20:00:44,718 INFO L226 Difference]: Without dead ends: 606 [2019-09-03 20:00:44,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11065 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5413, Invalid=25387, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:00:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-09-03 20:00:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 190. [2019-09-03 20:00:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:00:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:00:45,312 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:00:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:45,312 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:00:45,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:00:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:00:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:45,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:45,313 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:45,313 INFO L418 AbstractCegarLoop]: === Iteration 177 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash 639432592, now seen corresponding path program 126 times [2019-09-03 20:00:45,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:45,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:45,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:45,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:45,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:45,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:00:45,912 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-09-03 20:00:45,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:45,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:45,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:46,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:46,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 72 [2019-09-03 20:00:46,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:00:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:00:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:00:46,846 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 72 states. [2019-09-03 20:00:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:54,707 INFO L93 Difference]: Finished difference Result 734 states and 904 transitions. [2019-09-03 20:00:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 20:00:54,707 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 152 [2019-09-03 20:00:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:54,708 INFO L225 Difference]: With dead ends: 734 [2019-09-03 20:00:54,708 INFO L226 Difference]: Without dead ends: 672 [2019-09-03 20:00:54,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11967 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5806, Invalid=27136, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 20:00:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-03 20:00:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 190. [2019-09-03 20:00:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:00:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:00:55,308 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:00:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:55,308 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:00:55,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:00:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:00:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:00:55,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:55,309 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:55,309 INFO L418 AbstractCegarLoop]: === Iteration 178 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:55,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash 650829647, now seen corresponding path program 127 times [2019-09-03 20:00:55,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:55,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:55,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:55,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:55,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:55,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:00:55,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:00:56,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:56,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 71 [2019-09-03 20:00:56,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:00:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:00:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=4083, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:00:56,861 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 71 states. [2019-09-03 20:01:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:05,277 INFO L93 Difference]: Finished difference Result 799 states and 988 transitions. [2019-09-03 20:01:05,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 20:01:05,278 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 152 [2019-09-03 20:01:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:05,279 INFO L225 Difference]: With dead ends: 799 [2019-09-03 20:01:05,279 INFO L226 Difference]: Without dead ends: 737 [2019-09-03 20:01:05,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12606 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6078, Invalid=28332, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:01:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-03 20:01:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 190. [2019-09-03 20:01:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:01:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:01:05,887 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:01:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:05,887 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:01:05,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:01:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:01:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:01:05,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:05,888 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:05,888 INFO L418 AbstractCegarLoop]: === Iteration 179 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1427012688, now seen corresponding path program 128 times [2019-09-03 20:01:05,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:05,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:05,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:06,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:06,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:06,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:06,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:06,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:01:06,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:07,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:07,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 70 [2019-09-03 20:01:07,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:01:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:01:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=3969, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:01:07,405 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 70 states. [2019-09-03 20:01:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:15,952 INFO L93 Difference]: Finished difference Result 863 states and 1071 transitions. [2019-09-03 20:01:15,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 20:01:15,953 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 152 [2019-09-03 20:01:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:15,954 INFO L225 Difference]: With dead ends: 863 [2019-09-03 20:01:15,954 INFO L226 Difference]: Without dead ends: 801 [2019-09-03 20:01:15,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12956 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6217, Invalid=28939, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 20:01:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-03 20:01:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 190. [2019-09-03 20:01:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:01:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:01:16,574 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:01:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:16,574 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:01:16,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:01:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:01:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:01:16,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:16,575 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:16,575 INFO L418 AbstractCegarLoop]: === Iteration 180 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:16,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1831096111, now seen corresponding path program 129 times [2019-09-03 20:01:16,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:16,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:16,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:16,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:16,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:17,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:17,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:17,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:17,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:01:17,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:17,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:01:17,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:18,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:18,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 69 [2019-09-03 20:01:18,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:01:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:01:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=3853, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:01:18,134 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 69 states. [2019-09-03 20:01:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:27,435 INFO L93 Difference]: Finished difference Result 926 states and 1153 transitions. [2019-09-03 20:01:27,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 20:01:27,435 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 152 [2019-09-03 20:01:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:27,437 INFO L225 Difference]: With dead ends: 926 [2019-09-03 20:01:27,437 INFO L226 Difference]: Without dead ends: 864 [2019-09-03 20:01:27,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13003 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6217, Invalid=28939, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 20:01:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-09-03 20:01:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 190. [2019-09-03 20:01:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:01:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:01:28,066 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:01:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:28,066 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:01:28,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:01:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:01:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:01:28,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:28,067 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:28,067 INFO L418 AbstractCegarLoop]: === Iteration 181 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1111844912, now seen corresponding path program 130 times [2019-09-03 20:01:28,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:28,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:28,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:28,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:28,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:28,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:28,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:28,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:01:28,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:28,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:28,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:01:28,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:29,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:29,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 68 [2019-09-03 20:01:29,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:01:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:01:29,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=3735, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:01:29,593 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 68 states. [2019-09-03 20:01:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:39,088 INFO L93 Difference]: Finished difference Result 988 states and 1234 transitions. [2019-09-03 20:01:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 20:01:39,088 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 152 [2019-09-03 20:01:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:39,089 INFO L225 Difference]: With dead ends: 988 [2019-09-03 20:01:39,089 INFO L226 Difference]: Without dead ends: 926 [2019-09-03 20:01:39,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12741 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6078, Invalid=28332, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:01:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-09-03 20:01:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 190. [2019-09-03 20:01:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:01:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:01:39,731 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:01:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:39,731 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:01:39,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:01:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:01:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:01:39,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:39,732 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:39,732 INFO L418 AbstractCegarLoop]: === Iteration 182 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash -791136497, now seen corresponding path program 131 times [2019-09-03 20:01:39,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:39,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:39,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:40,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:40,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:40,292 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:01:40,354 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 20:01:40,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:40,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:01:40,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:41,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:41,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 67 [2019-09-03 20:01:41,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:01:41,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:01:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=3615, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:01:41,229 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 67 states. [2019-09-03 20:01:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:51,006 INFO L93 Difference]: Finished difference Result 1049 states and 1314 transitions. [2019-09-03 20:01:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 20:01:51,006 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 152 [2019-09-03 20:01:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:51,008 INFO L225 Difference]: With dead ends: 1049 [2019-09-03 20:01:51,008 INFO L226 Difference]: Without dead ends: 987 [2019-09-03 20:01:51,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12172 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5806, Invalid=27136, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 20:01:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-09-03 20:01:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 190. [2019-09-03 20:01:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:01:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:01:51,637 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:01:51,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:51,637 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:01:51,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:01:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:01:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:01:51,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:51,637 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:51,638 INFO L418 AbstractCegarLoop]: === Iteration 183 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash -503696400, now seen corresponding path program 132 times [2019-09-03 20:01:51,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:51,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:51,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:51,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:52,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:52,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:52,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:52,249 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-09-03 20:01:52,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:52,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:01:52,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:01:53,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:53,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 66 [2019-09-03 20:01:53,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:01:53,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:01:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=3493, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:01:53,064 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 66 states. [2019-09-03 20:02:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:02,725 INFO L93 Difference]: Finished difference Result 1109 states and 1393 transitions. [2019-09-03 20:02:02,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 20:02:02,726 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 152 [2019-09-03 20:02:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:02,727 INFO L225 Difference]: With dead ends: 1109 [2019-09-03 20:02:02,727 INFO L226 Difference]: Without dead ends: 1047 [2019-09-03 20:02:02,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11310 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5413, Invalid=25387, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:02:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-03 20:02:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 190. [2019-09-03 20:02:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:02:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:02:03,367 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:02:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:03,367 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:02:03,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:02:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:02:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:02:03,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:03,368 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:03,368 INFO L418 AbstractCegarLoop]: === Iteration 184 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1445238511, now seen corresponding path program 133 times [2019-09-03 20:02:03,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:03,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:03,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:03,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:03,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:04,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:02:04,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:04,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:04,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 65 [2019-09-03 20:02:04,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:02:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:02:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=3369, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:02:04,863 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 65 states. [2019-09-03 20:02:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:14,482 INFO L93 Difference]: Finished difference Result 1168 states and 1471 transitions. [2019-09-03 20:02:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 20:02:14,482 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 152 [2019-09-03 20:02:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:14,484 INFO L225 Difference]: With dead ends: 1168 [2019-09-03 20:02:14,484 INFO L226 Difference]: Without dead ends: 1106 [2019-09-03 20:02:14,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10181 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4917, Invalid=23139, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:02:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-03 20:02:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 190. [2019-09-03 20:02:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:02:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:02:15,147 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:02:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:15,147 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:02:15,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:02:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:02:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:02:15,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:15,147 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:15,148 INFO L418 AbstractCegarLoop]: === Iteration 185 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1817028592, now seen corresponding path program 134 times [2019-09-03 20:02:15,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:15,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:15,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:15,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:15,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:15,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:15,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:15,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:02:15,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:16,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:16,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 64 [2019-09-03 20:02:16,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:02:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:02:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=789, Invalid=3243, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:02:16,494 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 64 states. [2019-09-03 20:02:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:26,207 INFO L93 Difference]: Finished difference Result 1226 states and 1548 transitions. [2019-09-03 20:02:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:02:26,207 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 152 [2019-09-03 20:02:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:26,209 INFO L225 Difference]: With dead ends: 1226 [2019-09-03 20:02:26,209 INFO L226 Difference]: Without dead ends: 1164 [2019-09-03 20:02:26,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8823 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4342, Invalid=20464, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:02:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-09-03 20:02:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 190. [2019-09-03 20:02:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:02:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:02:26,872 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:02:26,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:26,872 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:02:26,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:02:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:02:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:02:26,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:26,873 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:26,873 INFO L418 AbstractCegarLoop]: === Iteration 186 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash -121147697, now seen corresponding path program 135 times [2019-09-03 20:02:26,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:26,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:26,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:27,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:27,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:27,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:27,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:02:27,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:27,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:02:27,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:28,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 63 [2019-09-03 20:02:28,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:02:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:02:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=3115, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:02:28,245 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 63 states. [2019-09-03 20:02:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:38,144 INFO L93 Difference]: Finished difference Result 1283 states and 1624 transitions. [2019-09-03 20:02:38,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:02:38,144 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 152 [2019-09-03 20:02:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:38,146 INFO L225 Difference]: With dead ends: 1283 [2019-09-03 20:02:38,146 INFO L226 Difference]: Without dead ends: 1221 [2019-09-03 20:02:38,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7286 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3718, Invalid=17452, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:02:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-03 20:02:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 190. [2019-09-03 20:02:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:02:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:02:38,799 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:02:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:38,799 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:02:38,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:02:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:02:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:02:38,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:38,800 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:38,800 INFO L418 AbstractCegarLoop]: === Iteration 187 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1734673456, now seen corresponding path program 136 times [2019-09-03 20:02:38,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:38,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:38,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:38,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:39,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:39,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:39,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:39,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:39,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:39,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:02:39,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:40,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:40,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 62 [2019-09-03 20:02:40,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:02:40,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:02:40,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=2985, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:02:40,151 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 62 states. [2019-09-03 20:02:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:49,892 INFO L93 Difference]: Finished difference Result 1339 states and 1699 transitions. [2019-09-03 20:02:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:02:49,892 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2019-09-03 20:02:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:49,894 INFO L225 Difference]: With dead ends: 1339 [2019-09-03 20:02:49,894 INFO L226 Difference]: Without dead ends: 1277 [2019-09-03 20:02:49,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5632 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=14211, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:02:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-09-03 20:02:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 190. [2019-09-03 20:02:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:02:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-03 20:02:50,552 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-03 20:02:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:50,552 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-03 20:02:50,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:02:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-03 20:02:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:02:50,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:50,552 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:50,553 INFO L418 AbstractCegarLoop]: === Iteration 188 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1946239313, now seen corresponding path program 17 times [2019-09-03 20:02:50,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:50,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:50,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:50,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:51,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:51,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:02:51,279 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 20:02:51,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:51,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:02:51,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:02:51,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:51,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 61 [2019-09-03 20:02:51,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:02:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:02:51,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2853, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:02:51,973 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 61 states. [2019-09-03 20:03:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:01,587 INFO L93 Difference]: Finished difference Result 1397 states and 1777 transitions. [2019-09-03 20:03:01,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:03:01,588 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2019-09-03 20:03:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:01,590 INFO L225 Difference]: With dead ends: 1397 [2019-09-03 20:03:01,590 INFO L226 Difference]: Without dead ends: 1335 [2019-09-03 20:03:01,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3935 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2473, Invalid=10867, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:03:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-03 20:03:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 192. [2019-09-03 20:03:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 20:03:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2019-09-03 20:03:02,256 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 152 [2019-09-03 20:03:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:02,257 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2019-09-03 20:03:02,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:03:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2019-09-03 20:03:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 20:03:02,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:02,257 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:02,257 INFO L418 AbstractCegarLoop]: === Iteration 189 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:02,258 INFO L82 PathProgramCache]: Analyzing trace with hash -441371960, now seen corresponding path program 34 times [2019-09-03 20:03:02,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:02,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:02,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:03:02,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:02,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:02,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:03:02,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:02,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:02,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:02,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:02,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:03:02,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:02,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-09-03 20:03:02,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:03:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:03:02,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:03:02,598 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 25 states. [2019-09-03 20:03:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:03,602 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2019-09-03 20:03:03,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:03:03,602 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 153 [2019-09-03 20:03:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:03,603 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:03:03,603 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 20:03:03,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:03:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 20:03:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-03 20:03:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 20:03:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2019-09-03 20:03:04,268 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 153 [2019-09-03 20:03:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:04,269 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2019-09-03 20:03:04,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:03:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2019-09-03 20:03:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:03:04,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:04,269 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:04,269 INFO L418 AbstractCegarLoop]: === Iteration 190 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:04,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1575080431, now seen corresponding path program 35 times [2019-09-03 20:03:04,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:04,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:04,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:04,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:05,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:05,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:05,026 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:03:05,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 20:03:05,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:05,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:05,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:06,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:06,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 82 [2019-09-03 20:03:06,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 20:03:06,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 20:03:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1303, Invalid=5339, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:03:06,272 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 82 states. [2019-09-03 20:03:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:09,639 INFO L93 Difference]: Finished difference Result 340 states and 399 transitions. [2019-09-03 20:03:09,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:03:09,639 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-09-03 20:03:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:09,640 INFO L225 Difference]: With dead ends: 340 [2019-09-03 20:03:09,640 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 20:03:09,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4859 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2723, Invalid=12039, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:03:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 20:03:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 200. [2019-09-03 20:03:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:03:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 20:03:10,342 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 20:03:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:10,342 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 20:03:10,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 20:03:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 20:03:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:03:10,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:10,342 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:10,343 INFO L418 AbstractCegarLoop]: === Iteration 191 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 862175086, now seen corresponding path program 137 times [2019-09-03 20:03:10,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:10,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:10,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:10,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:10,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:10,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:03:10,993 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 20:03:10,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:10,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:10,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:12,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:12,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 81 [2019-09-03 20:03:12,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:03:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:03:12,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1246, Invalid=5234, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:03:12,114 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 81 states. [2019-09-03 20:03:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:16,545 INFO L93 Difference]: Finished difference Result 415 states and 494 transitions. [2019-09-03 20:03:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:03:16,546 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-09-03 20:03:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:16,546 INFO L225 Difference]: With dead ends: 415 [2019-09-03 20:03:16,546 INFO L226 Difference]: Without dead ends: 350 [2019-09-03 20:03:16,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6439 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3403, Invalid=15779, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:03:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-03 20:03:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2019-09-03 20:03:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:03:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 20:03:17,281 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 20:03:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:17,281 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 20:03:17,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:03:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 20:03:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:03:17,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:17,282 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:17,282 INFO L418 AbstractCegarLoop]: === Iteration 192 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash 423536143, now seen corresponding path program 138 times [2019-09-03 20:03:17,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:17,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:17,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:17,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:17,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:17,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:17,890 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:03:17,950 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 20:03:17,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:17,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:17,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:19,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:19,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 80 [2019-09-03 20:03:19,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 20:03:19,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 20:03:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=5127, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:03:19,073 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 80 states. [2019-09-03 20:03:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:24,562 INFO L93 Difference]: Finished difference Result 489 states and 588 transitions. [2019-09-03 20:03:24,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:03:24,562 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2019-09-03 20:03:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:24,563 INFO L225 Difference]: With dead ends: 489 [2019-09-03 20:03:24,563 INFO L226 Difference]: Without dead ends: 424 [2019-09-03 20:03:24,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8087 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4123, Invalid=19439, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:03:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-03 20:03:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 200. [2019-09-03 20:03:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:03:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 20:03:25,319 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 20:03:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:25,320 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 20:03:25,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 20:03:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 20:03:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:03:25,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:25,321 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:25,321 INFO L418 AbstractCegarLoop]: === Iteration 193 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:25,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1391728818, now seen corresponding path program 139 times [2019-09-03 20:03:25,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:25,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:25,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:25,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:25,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:25,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:25,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:25,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:26,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:26,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:27,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:27,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 79 [2019-09-03 20:03:27,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:03:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:03:27,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1144, Invalid=5018, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:03:27,146 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 79 states. [2019-09-03 20:03:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:33,659 INFO L93 Difference]: Finished difference Result 562 states and 681 transitions. [2019-09-03 20:03:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 20:03:33,660 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 160 [2019-09-03 20:03:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:33,660 INFO L225 Difference]: With dead ends: 562 [2019-09-03 20:03:33,661 INFO L226 Difference]: Without dead ends: 497 [2019-09-03 20:03:33,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9711 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4838, Invalid=22884, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 20:03:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-03 20:03:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 200. [2019-09-03 20:03:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:03:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 20:03:34,429 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 20:03:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:34,429 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 20:03:34,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:03:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 20:03:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:03:34,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:34,430 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:34,430 INFO L418 AbstractCegarLoop]: === Iteration 194 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2013397551, now seen corresponding path program 140 times [2019-09-03 20:03:34,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:34,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:35,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:35,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:03:35,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:35,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:35,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:35,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:36,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:36,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 78 [2019-09-03 20:03:36,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:03:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:03:36,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:03:36,155 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 78 states. [2019-09-03 20:03:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:43,891 INFO L93 Difference]: Finished difference Result 634 states and 773 transitions. [2019-09-03 20:03:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 20:03:43,892 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-03 20:03:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:43,893 INFO L225 Difference]: With dead ends: 634 [2019-09-03 20:03:43,893 INFO L226 Difference]: Without dead ends: 569 [2019-09-03 20:03:43,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11231 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5509, Invalid=25997, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 20:03:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-03 20:03:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 200. [2019-09-03 20:03:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:03:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 20:03:44,679 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 20:03:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:44,679 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 20:03:44,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:03:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 20:03:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:03:44,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:44,680 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:44,680 INFO L418 AbstractCegarLoop]: === Iteration 195 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:44,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1201895634, now seen corresponding path program 141 times [2019-09-03 20:03:44,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:44,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:44,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:44,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:44,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:45,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:45,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:45,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:03:45,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 20:03:45,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:45,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:45,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:46,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:46,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 77 [2019-09-03 20:03:46,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:03:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:03:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=4794, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:03:46,486 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 77 states. [2019-09-03 20:03:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:55,171 INFO L93 Difference]: Finished difference Result 705 states and 864 transitions. [2019-09-03 20:03:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-03 20:03:55,171 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 160 [2019-09-03 20:03:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:55,172 INFO L225 Difference]: With dead ends: 705 [2019-09-03 20:03:55,172 INFO L226 Difference]: Without dead ends: 640 [2019-09-03 20:03:55,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12579 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6103, Invalid=28679, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 20:03:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-03 20:03:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 200. [2019-09-03 20:03:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:03:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-03 20:03:55,968 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-03 20:03:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:55,968 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-03 20:03:55,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:03:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-03 20:03:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:03:55,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:55,969 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:55,969 INFO L418 AbstractCegarLoop]: === Iteration 196 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1305614769, now seen corresponding path program 142 times [2019-09-03 20:03:55,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:55,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:55,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:56,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:56,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:56,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:03:56,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:56,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:56,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:03:56,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:03:57,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:57,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 76 [2019-09-03 20:03:57,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:03:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:03:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=4679, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:03:57,616 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 76 states.