java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copyInitSum_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:57:38,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:57:38,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:57:38,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:57:38,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:57:38,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:57:38,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:57:38,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:57:38,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:57:38,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:57:38,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:57:38,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:57:38,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:57:38,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:57:38,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:57:38,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:57:38,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:57:38,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:57:38,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:57:38,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:57:38,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:57:38,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:57:38,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:57:38,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:57:38,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:57:38,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:57:38,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:57:38,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:57:38,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:57:38,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:57:38,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:57:38,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:57:38,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:57:38,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:57:38,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:57:38,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:57:38,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:57:38,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:57:38,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:57:38,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:57:38,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:57:38,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:57:38,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:57:38,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:57:38,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:57:38,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:57:38,127 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:57:38,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:57:38,127 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:57:38,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:57:38,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:57:38,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:57:38,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:57:38,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:57:38,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:57:38,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:57:38,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:57:38,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:57:38,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:57:38,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:57:38,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:57:38,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:57:38,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:57:38,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:38,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:57:38,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:57:38,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:57:38,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:57:38,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:57:38,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:57:38,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:57:38,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:57:38,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:57:38,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:57:38,180 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:57:38,181 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:57:38,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum_ground.i [2019-10-01 22:57:38,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011f52e96/af9105b2299a45f6b11322f376402108/FLAG007005b28 [2019-10-01 22:57:38,657 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:57:38,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum_ground.i [2019-10-01 22:57:38,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011f52e96/af9105b2299a45f6b11322f376402108/FLAG007005b28 [2019-10-01 22:57:39,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011f52e96/af9105b2299a45f6b11322f376402108 [2019-10-01 22:57:39,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:57:39,043 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:57:39,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:39,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:57:39,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:57:39,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a63c31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39, skipping insertion in model container [2019-10-01 22:57:39,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,059 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:57:39,077 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:57:39,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:39,320 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:57:39,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:39,363 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:57:39,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39 WrapperNode [2019-10-01 22:57:39,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:39,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:57:39,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:57:39,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:57:39,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... [2019-10-01 22:57:39,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:57:39,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:57:39,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:57:39,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:57:39,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:57:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:57:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:57:39,591 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:57:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:57:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:57:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:57:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:57:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:57:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:57:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:57:39,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:57:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:57:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:57:39,885 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:57:39,886 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-01 22:57:39,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:39 BoogieIcfgContainer [2019-10-01 22:57:39,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:57:39,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:57:39,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:57:39,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:57:39,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:57:39" (1/3) ... [2019-10-01 22:57:39,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1136dcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:39, skipping insertion in model container [2019-10-01 22:57:39,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:39" (2/3) ... [2019-10-01 22:57:39,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1136dcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:39, skipping insertion in model container [2019-10-01 22:57:39,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:39" (3/3) ... [2019-10-01 22:57:39,898 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum_ground.i [2019-10-01 22:57:39,908 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:57:39,920 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:57:39,952 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:57:39,991 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:57:39,992 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:57:39,995 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:57:39,995 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:57:39,996 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:57:39,996 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:57:39,996 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:57:39,996 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:57:39,996 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:57:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-01 22:57:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:57:40,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:40,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:40,030 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2019-10-01 22:57:40,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:40,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:40,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:57:40,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:57:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:57:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:40,196 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-01 22:57:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:40,219 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2019-10-01 22:57:40,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:57:40,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-01 22:57:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:40,229 INFO L225 Difference]: With dead ends: 51 [2019-10-01 22:57:40,229 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 22:57:40,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 22:57:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 22:57:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 22:57:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-01 22:57:40,274 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2019-10-01 22:57:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:40,275 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-01 22:57:40,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:57:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-01 22:57:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:57:40,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:40,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:40,277 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2019-10-01 22:57:40,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:40,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:40,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:57:40,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:57:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:57:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:40,344 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-10-01 22:57:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:40,434 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:57:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:57:40,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-01 22:57:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:40,437 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:57:40,437 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:57:40,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:57:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-01 22:57:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:57:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-01 22:57:40,445 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-10-01 22:57:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:40,446 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-01 22:57:40,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:57:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-01 22:57:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 22:57:40,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:40,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:40,447 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2019-10-01 22:57:40,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:40,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:40,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:57:40,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:40,544 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:40,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:57:40,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:57:40,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:40,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:57:40,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:57:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:57:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:40,655 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2019-10-01 22:57:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:40,732 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-10-01 22:57:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:57:40,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-01 22:57:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:40,734 INFO L225 Difference]: With dead ends: 53 [2019-10-01 22:57:40,734 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:57:40,735 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:57:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-01 22:57:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:57:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-01 22:57:40,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2019-10-01 22:57:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:40,742 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-01 22:57:40,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:57:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-01 22:57:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:57:40,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:40,744 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:40,744 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1868122094, now seen corresponding path program 2 times [2019-10-01 22:57:40,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:40,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:57:40,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:40,852 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:40,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:40,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:40,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:40,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:57:40,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 22:57:40,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:40,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:57:40,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:57:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:57:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:40,951 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2019-10-01 22:57:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:41,038 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:57:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:57:41,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-01 22:57:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:41,040 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:57:41,040 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:57:41,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:57:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:57:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:57:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-01 22:57:41,048 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2019-10-01 22:57:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:41,049 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-01 22:57:41,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:57:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-01 22:57:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:57:41,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:41,051 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:41,051 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:41,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash 150752210, now seen corresponding path program 3 times [2019-10-01 22:57:41,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 22:57:41,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:41,153 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:41,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:41,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:57:41,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:41,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:57:41,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:57:41,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:41,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:57:41,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:57:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:57:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:41,259 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2019-10-01 22:57:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:41,350 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2019-10-01 22:57:41,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:57:41,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-01 22:57:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:41,351 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:57:41,352 INFO L226 Difference]: Without dead ends: 44 [2019-10-01 22:57:41,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-01 22:57:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-01 22:57:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:57:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-01 22:57:41,359 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2019-10-01 22:57:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:41,359 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-01 22:57:41,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:57:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-01 22:57:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 22:57:41,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:41,362 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:41,362 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 4 times [2019-10-01 22:57:41,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:41,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 22:57:41,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:41,504 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:41,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:41,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:41,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:57:41,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 22:57:41,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:41,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:57:41,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:57:41,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:57:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:41,578 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2019-10-01 22:57:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:41,675 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2019-10-01 22:57:41,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:57:41,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-10-01 22:57:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:41,680 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:57:41,680 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:57:41,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:57:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:57:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:57:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-10-01 22:57:41,692 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2019-10-01 22:57:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:41,694 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-10-01 22:57:41,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:57:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-10-01 22:57:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:57:41,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:41,696 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:41,697 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1558523702, now seen corresponding path program 5 times [2019-10-01 22:57:41,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:41,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 22:57:41,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:41,851 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:41,874 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:42,235 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:57:42,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:42,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:57:42,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 22:57:42,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:42,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:57:42,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:57:42,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:57:42,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:42,280 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2019-10-01 22:57:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:42,386 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-01 22:57:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:57:42,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-01 22:57:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:42,387 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:57:42,387 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:57:42,388 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:57:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-10-01 22:57:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:57:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-10-01 22:57:42,396 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 42 [2019-10-01 22:57:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:42,396 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-10-01 22:57:42,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:57:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-10-01 22:57:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:57:42,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:42,398 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:42,398 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1349350398, now seen corresponding path program 6 times [2019-10-01 22:57:42,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:42,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 22:57:42,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:42,568 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:42,599 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:42,845 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:57:42,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:42,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:57:42,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 22:57:42,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:42,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:57:42,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:57:42,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:57:42,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:42,885 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2019-10-01 22:57:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,016 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-10-01 22:57:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:57:43,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-10-01 22:57:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,019 INFO L225 Difference]: With dead ends: 98 [2019-10-01 22:57:43,019 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 22:57:43,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 22:57:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-10-01 22:57:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 22:57:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-10-01 22:57:43,034 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 47 [2019-10-01 22:57:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,034 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-10-01 22:57:43,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:57:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-10-01 22:57:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-01 22:57:43,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,039 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,039 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1128841790, now seen corresponding path program 7 times [2019-10-01 22:57:43,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-01 22:57:43,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,174 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-01 22:57:43,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:57:43,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:57:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:57:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:43,275 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 11 states. [2019-10-01 22:57:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,410 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-10-01 22:57:43,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:57:43,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-10-01 22:57:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,411 INFO L225 Difference]: With dead ends: 107 [2019-10-01 22:57:43,412 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:57:43,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:57:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-10-01 22:57:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 22:57:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-10-01 22:57:43,430 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 52 [2019-10-01 22:57:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,433 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-10-01 22:57:43,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:57:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-10-01 22:57:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 22:57:43,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,434 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,434 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -612503046, now seen corresponding path program 8 times [2019-10-01 22:57:43,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:43,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-01 22:57:43,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,570 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:43,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:43,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:43,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:43,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:57:43,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:43,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:43,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:57:43,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:57:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:57:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:43,671 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 12 states. [2019-10-01 22:57:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:43,793 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-10-01 22:57:43,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:57:43,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-10-01 22:57:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:43,794 INFO L225 Difference]: With dead ends: 116 [2019-10-01 22:57:43,795 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:57:43,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:57:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:57:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:57:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-01 22:57:43,802 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 57 [2019-10-01 22:57:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:43,803 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-01 22:57:43,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:57:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-01 22:57:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 22:57:43,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:43,804 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:43,805 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash -490630470, now seen corresponding path program 9 times [2019-10-01 22:57:43,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:43,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-01 22:57:43,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:43,924 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:43,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:44,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:57:44,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:44,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:57:44,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-01 22:57:44,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:44,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 22:57:44,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:57:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:57:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:44,232 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 13 states. [2019-10-01 22:57:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:44,355 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-10-01 22:57:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:57:44,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-01 22:57:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:44,356 INFO L225 Difference]: With dead ends: 125 [2019-10-01 22:57:44,356 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 22:57:44,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 22:57:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-10-01 22:57:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 22:57:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-10-01 22:57:44,364 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 62 [2019-10-01 22:57:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:44,364 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-10-01 22:57:44,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:57:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-10-01 22:57:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:57:44,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:44,366 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:44,366 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 10 times [2019-10-01 22:57:44,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:44,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:44,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-01 22:57:44,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:44,505 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:44,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:44,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:44,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:44,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:57:44,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 22:57:44,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:44,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:57:44,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:57:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:57:44,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:44,592 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 14 states. [2019-10-01 22:57:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:44,695 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2019-10-01 22:57:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:57:44,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-10-01 22:57:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:44,697 INFO L225 Difference]: With dead ends: 134 [2019-10-01 22:57:44,697 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 22:57:44,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 22:57:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-10-01 22:57:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:57:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-10-01 22:57:44,704 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 67 [2019-10-01 22:57:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:44,705 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-10-01 22:57:44,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:57:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-10-01 22:57:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:57:44,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:44,707 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:44,707 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:44,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2083114930, now seen corresponding path program 11 times [2019-10-01 22:57:44,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:44,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-10-01 22:57:44,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:44,853 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:44,874 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:57,624 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 22:57:57,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:57,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:57:57,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-01 22:57:57,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:57,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:57:57,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:57:57,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:57:57,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:57,712 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 15 states. [2019-10-01 22:57:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:57,880 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2019-10-01 22:57:57,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:57:57,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:57:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:57,882 INFO L225 Difference]: With dead ends: 143 [2019-10-01 22:57:57,882 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:57:57,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:57:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-01 22:57:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 22:57:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-10-01 22:57:57,890 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 72 [2019-10-01 22:57:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:57,890 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-10-01 22:57:57,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:57:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-10-01 22:57:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 22:57:57,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:57,892 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:57,892 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:57,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash 385857002, now seen corresponding path program 12 times [2019-10-01 22:57:57,892 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:57,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:57:58,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:58,059 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:58,093 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:58:13,420 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:58:13,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:13,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:58:13,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 22:58:13,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:13,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:58:13,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:58:13,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:58:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:58:13,495 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 16 states. [2019-10-01 22:58:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:13,646 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 22:58:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:58:13,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-10-01 22:58:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:13,648 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:58:13,648 INFO L226 Difference]: Without dead ends: 89 [2019-10-01 22:58:13,649 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:58:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-01 22:58:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-10-01 22:58:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:58:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2019-10-01 22:58:13,655 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 77 [2019-10-01 22:58:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:13,655 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2019-10-01 22:58:13,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:58:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2019-10-01 22:58:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-01 22:58:13,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:13,657 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:13,657 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1239413930, now seen corresponding path program 13 times [2019-10-01 22:58:13,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:13,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-10-01 22:58:13,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:13,846 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:13,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:13,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:58:13,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-10-01 22:58:13,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:13,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:58:13,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:58:13,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:58:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:58:13,978 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 17 states. [2019-10-01 22:58:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:14,182 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2019-10-01 22:58:14,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:58:14,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2019-10-01 22:58:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:14,184 INFO L225 Difference]: With dead ends: 161 [2019-10-01 22:58:14,184 INFO L226 Difference]: Without dead ends: 94 [2019-10-01 22:58:14,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:58:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-01 22:58:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-10-01 22:58:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-01 22:58:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-10-01 22:58:14,192 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 82 [2019-10-01 22:58:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:14,192 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-10-01 22:58:14,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:58:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-10-01 22:58:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 22:58:14,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:14,194 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:14,195 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash -535424030, now seen corresponding path program 14 times [2019-10-01 22:58:14,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:14,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:14,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:58:14,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:14,402 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:58:14,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:14,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:58:14,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:14,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:58:14,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:58:14,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:14,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:58:14,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:58:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:58:14,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:58:14,495 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 18 states. [2019-10-01 22:58:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:14,653 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2019-10-01 22:58:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:58:14,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-10-01 22:58:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:14,654 INFO L225 Difference]: With dead ends: 170 [2019-10-01 22:58:14,654 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:58:14,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:58:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:58:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-10-01 22:58:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 22:58:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2019-10-01 22:58:14,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 87 [2019-10-01 22:58:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:14,661 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2019-10-01 22:58:14,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:58:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2019-10-01 22:58:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:58:14,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:14,663 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:14,664 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash -422313566, now seen corresponding path program 15 times [2019-10-01 22:58:14,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:14,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:14,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:14,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-01 22:58:14,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:14,997 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:58:18,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:58:18,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:18,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:58:18,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-01 22:58:18,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:18,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:58:18,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:58:18,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:58:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:58:18,446 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 19 states. [2019-10-01 22:58:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:18,605 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2019-10-01 22:58:18,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:58:18,605 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:58:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:18,606 INFO L225 Difference]: With dead ends: 179 [2019-10-01 22:58:18,607 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 22:58:18,607 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:58:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 22:58:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-10-01 22:58:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 22:58:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-10-01 22:58:18,613 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 92 [2019-10-01 22:58:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:18,613 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-10-01 22:58:18,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:58:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-10-01 22:58:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 22:58:18,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:18,614 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:18,615 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1861215782, now seen corresponding path program 16 times [2019-10-01 22:58:18,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:18,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:18,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:18,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:58:18,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:18,847 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:18,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:58:18,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:58:18,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:18,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:58:18,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:58:18,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:18,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:58:18,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:58:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:58:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:58:18,968 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 20 states. [2019-10-01 22:58:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:19,135 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2019-10-01 22:58:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:58:19,137 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-10-01 22:58:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:19,139 INFO L225 Difference]: With dead ends: 188 [2019-10-01 22:58:19,139 INFO L226 Difference]: Without dead ends: 109 [2019-10-01 22:58:19,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:58:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-01 22:58:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-10-01 22:58:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:58:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-10-01 22:58:19,145 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 97 [2019-10-01 22:58:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:19,146 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-10-01 22:58:19,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:58:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-10-01 22:58:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 22:58:19,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:19,147 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:19,147 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:19,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1207301786, now seen corresponding path program 17 times [2019-10-01 22:58:19,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:19,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:19,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:58:19,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:19,404 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:59:27,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 22:59:27,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:27,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:59:27,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:59:27,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:27,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:59:27,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:59:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:59:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:59:27,961 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 21 states. [2019-10-01 22:59:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:28,188 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2019-10-01 22:59:28,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:59:28,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2019-10-01 22:59:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:28,190 INFO L225 Difference]: With dead ends: 197 [2019-10-01 22:59:28,190 INFO L226 Difference]: Without dead ends: 114 [2019-10-01 22:59:28,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:59:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-01 22:59:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-01 22:59:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 22:59:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2019-10-01 22:59:28,195 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 102 [2019-10-01 22:59:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:28,195 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2019-10-01 22:59:28,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:59:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2019-10-01 22:59:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 22:59:28,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:28,197 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:28,197 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1112684590, now seen corresponding path program 18 times [2019-10-01 22:59:28,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:28,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:28,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-10-01 22:59:28,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:28,460 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:59:28,491 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:00:57,889 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:00:57,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:57,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:00:57,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 18 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-01 23:00:58,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:58,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-10-01 23:00:58,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:00:58,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:00:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:58,003 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 23 states. [2019-10-01 23:00:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:58,230 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2019-10-01 23:00:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:00:58,230 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 107 [2019-10-01 23:00:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:58,233 INFO L225 Difference]: With dead ends: 214 [2019-10-01 23:00:58,233 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 23:00:58,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 23:00:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-10-01 23:00:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 23:00:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2019-10-01 23:00:58,252 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 107 [2019-10-01 23:00:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:58,252 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2019-10-01 23:00:58,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:00:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2019-10-01 23:00:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-01 23:00:58,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:58,254 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:58,254 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1010160530, now seen corresponding path program 19 times [2019-10-01 23:00:58,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:58,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:58,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:58,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:58,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-10-01 23:00:58,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:58,506 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:58,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:00:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:58,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:00:58,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-10-01 23:00:58,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:58,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:00:58,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:00:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:00:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:58,631 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 23 states. [2019-10-01 23:00:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:58,816 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2019-10-01 23:00:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:00:58,819 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 112 [2019-10-01 23:00:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:58,821 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:00:58,821 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 23:00:58,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 23:00:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-01 23:00:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-01 23:00:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2019-10-01 23:00:58,828 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 112 [2019-10-01 23:00:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:58,828 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2019-10-01 23:00:58,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:00:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2019-10-01 23:00:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:00:58,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:58,830 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:58,830 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1884348982, now seen corresponding path program 20 times [2019-10-01 23:00:58,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:58,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:58,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:58,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:00:58,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-01 23:00:59,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:59,106 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:00:59,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:00:59,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:59,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:00:59,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-01 23:00:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:59,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:00:59,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:00:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:00:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:00:59,252 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 24 states. [2019-10-01 23:00:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:59,572 INFO L93 Difference]: Finished difference Result 224 states and 232 transitions. [2019-10-01 23:00:59,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:00:59,576 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2019-10-01 23:00:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:59,579 INFO L225 Difference]: With dead ends: 224 [2019-10-01 23:00:59,579 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 23:00:59,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:00:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 23:00:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-10-01 23:00:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 23:00:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2019-10-01 23:00:59,588 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 117 [2019-10-01 23:00:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:59,589 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2019-10-01 23:00:59,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:00:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2019-10-01 23:00:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 23:00:59,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:59,590 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:59,591 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash -326920054, now seen corresponding path program 21 times [2019-10-01 23:00:59,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:59,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:59,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:59,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-10-01 23:00:59,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:59,893 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:59,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:01:16,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:01:16,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:16,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:01:16,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-10-01 23:01:16,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:16,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:01:16,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:01:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:01:16,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:01:16,686 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand 25 states. [2019-10-01 23:01:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:16,900 INFO L93 Difference]: Finished difference Result 233 states and 241 transitions. [2019-10-01 23:01:16,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:01:16,900 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2019-10-01 23:01:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:16,901 INFO L225 Difference]: With dead ends: 233 [2019-10-01 23:01:16,901 INFO L226 Difference]: Without dead ends: 134 [2019-10-01 23:01:16,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:01:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-01 23:01:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-10-01 23:01:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-01 23:01:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-10-01 23:01:16,907 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 122 [2019-10-01 23:01:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:16,907 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-10-01 23:01:16,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:01:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-10-01 23:01:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-01 23:01:16,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:16,909 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:16,909 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1188305858, now seen corresponding path program 22 times [2019-10-01 23:01:16,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:16,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 23:01:17,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:17,219 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:17,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:01:17,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:01:17,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:17,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:01:17,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-01 23:01:17,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:17,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:01:17,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:01:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:01:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:01:17,342 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 26 states. [2019-10-01 23:01:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:17,544 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 23:01:17,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:01:17,545 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 127 [2019-10-01 23:01:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:17,546 INFO L225 Difference]: With dead ends: 242 [2019-10-01 23:01:17,546 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 23:01:17,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:01:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 23:01:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-01 23:01:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 23:01:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2019-10-01 23:01:17,553 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 127 [2019-10-01 23:01:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:17,553 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2019-10-01 23:01:17,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:01:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2019-10-01 23:01:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 23:01:17,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:17,555 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:17,555 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1540310402, now seen corresponding path program 23 times [2019-10-01 23:01:17,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:17,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-10-01 23:01:17,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:17,968 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:03:23,640 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 23:03:23,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:23,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:03:23,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-10-01 23:03:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:03:23,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:03:23,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:03:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:03:23,785 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 27 states. [2019-10-01 23:03:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:24,026 INFO L93 Difference]: Finished difference Result 251 states and 259 transitions. [2019-10-01 23:03:24,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:03:24,026 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-10-01 23:03:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:24,027 INFO L225 Difference]: With dead ends: 251 [2019-10-01 23:03:24,027 INFO L226 Difference]: Without dead ends: 144 [2019-10-01 23:03:24,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:03:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-01 23:03:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-10-01 23:03:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-01 23:03:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-10-01 23:03:24,034 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 132 [2019-10-01 23:03:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:24,034 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-10-01 23:03:24,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:03:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-10-01 23:03:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 23:03:24,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:24,036 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:24,036 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1193492038, now seen corresponding path program 24 times [2019-10-01 23:03:24,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:24,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:24,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 23:03:24,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:24,395 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:03:24,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:06:06,330 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:06:06,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:06,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:06:06,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 23:06:06,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:06,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:06:06,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:06:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:06:06,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:06:06,459 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 28 states. [2019-10-01 23:06:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:06,793 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 23:06:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:06:06,795 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 137 [2019-10-01 23:06:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:06,797 INFO L225 Difference]: With dead ends: 260 [2019-10-01 23:06:06,797 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 23:06:06,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:06:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 23:06:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2019-10-01 23:06:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 23:06:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2019-10-01 23:06:06,810 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 137 [2019-10-01 23:06:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:06,810 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2019-10-01 23:06:06,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:06:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2019-10-01 23:06:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:06:06,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:06,813 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:06,814 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:06,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:06,814 INFO L82 PathProgramCache]: Analyzing trace with hash -418850182, now seen corresponding path program 25 times [2019-10-01 23:06:06,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:06,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:06,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:06,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-10-01 23:06:07,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:07,394 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:06:07,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:07,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:06:07,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-10-01 23:06:07,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:07,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:06:07,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:06:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:06:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:06:07,541 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 29 states. [2019-10-01 23:06:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:07,772 INFO L93 Difference]: Finished difference Result 269 states and 277 transitions. [2019-10-01 23:06:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:06:07,773 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 142 [2019-10-01 23:06:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:07,774 INFO L225 Difference]: With dead ends: 269 [2019-10-01 23:06:07,774 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 23:06:07,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:06:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 23:06:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-10-01 23:06:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-01 23:06:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-10-01 23:06:07,780 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 142 [2019-10-01 23:06:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:07,780 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-10-01 23:06:07,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:06:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-10-01 23:06:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 23:06:07,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:07,782 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:07,782 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash -779546702, now seen corresponding path program 26 times [2019-10-01 23:06:07,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:07,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:07,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-10-01 23:06:08,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:08,198 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:06:08,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:06:08,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:06:08,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:08,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:06:08,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:06:08,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:08,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:06:08,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:06:08,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:06:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:06:08,360 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 30 states. [2019-10-01 23:06:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:08,618 INFO L93 Difference]: Finished difference Result 278 states and 286 transitions. [2019-10-01 23:06:08,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:06:08,618 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 147 [2019-10-01 23:06:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:08,619 INFO L225 Difference]: With dead ends: 278 [2019-10-01 23:06:08,619 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 23:06:08,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:06:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 23:06:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 23:06:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 23:06:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2019-10-01 23:06:08,632 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 147 [2019-10-01 23:06:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:08,633 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2019-10-01 23:06:08,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:06:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2019-10-01 23:06:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 23:06:08,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:08,634 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:08,634 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:08,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash -987736206, now seen corresponding path program 27 times [2019-10-01 23:06:08,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:08,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-10-01 23:06:09,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:09,130 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:06:09,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:07:00,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:07:00,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:00,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:07:00,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-10-01 23:07:00,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:00,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:07:00,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:07:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:07:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:07:00,241 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 31 states. [2019-10-01 23:07:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:00,526 INFO L93 Difference]: Finished difference Result 287 states and 295 transitions. [2019-10-01 23:07:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:07:00,530 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 152 [2019-10-01 23:07:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:00,532 INFO L225 Difference]: With dead ends: 287 [2019-10-01 23:07:00,532 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 23:07:00,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:07:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 23:07:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-01 23:07:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 23:07:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 165 transitions. [2019-10-01 23:07:00,542 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 165 transitions. Word has length 152 [2019-10-01 23:07:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:00,542 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 165 transitions. [2019-10-01 23:07:00,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:07:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 165 transitions. [2019-10-01 23:07:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 23:07:00,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:00,544 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:00,544 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:00,544 INFO L82 PathProgramCache]: Analyzing trace with hash 312018346, now seen corresponding path program 28 times [2019-10-01 23:07:00,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:00,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:00,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2019-10-01 23:07:01,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:01,153 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:07:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:07:01,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:07:01,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:01,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:07:01,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-10-01 23:07:01,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:01,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:07:01,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:07:01,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:07:01,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:07:01,323 INFO L87 Difference]: Start difference. First operand 162 states and 165 transitions. Second operand 32 states. [2019-10-01 23:07:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:01,582 INFO L93 Difference]: Finished difference Result 296 states and 304 transitions. [2019-10-01 23:07:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:07:01,582 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2019-10-01 23:07:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:01,584 INFO L225 Difference]: With dead ends: 296 [2019-10-01 23:07:01,584 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:07:01,585 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:07:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:07:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-10-01 23:07:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 23:07:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2019-10-01 23:07:01,594 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 157 [2019-10-01 23:07:01,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:01,594 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2019-10-01 23:07:01,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:07:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2019-10-01 23:07:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 23:07:01,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:01,596 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:01,597 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:01,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2029667222, now seen corresponding path program 29 times [2019-10-01 23:07:01,598 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:01,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2019-10-01 23:07:02,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:02,092 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:07:02,151 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:09:53,142 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 23:09:53,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:09:53,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:09:53,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:09:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2019-10-01 23:09:53,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:09:53,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:09:53,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:09:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:09:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:09:53,340 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 33 states. [2019-10-01 23:09:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:09:53,663 INFO L93 Difference]: Finished difference Result 305 states and 313 transitions. [2019-10-01 23:09:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:09:53,664 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 162 [2019-10-01 23:09:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:09:53,665 INFO L225 Difference]: With dead ends: 305 [2019-10-01 23:09:53,665 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 23:09:53,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:09:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 23:09:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-01 23:09:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 23:09:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2019-10-01 23:09:53,673 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 162 [2019-10-01 23:09:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:09:53,673 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2019-10-01 23:09:53,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:09:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2019-10-01 23:09:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 23:09:53,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:09:53,674 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:09:53,675 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:09:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:09:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash 332178338, now seen corresponding path program 30 times [2019-10-01 23:09:53,675 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:09:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:09:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:53,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:09:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:09:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 23:09:54,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:09:54,251 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:09:54,301 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE