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-industry-pattern/array_ptr_partial_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:53:33,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:53:33,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:53:33,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:53:33,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:53:33,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:53:33,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:53:33,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:53:33,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:53:33,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:53:33,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:53:33,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:53:33,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:53:33,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:53:33,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:53:33,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:53:33,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:53:33,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:53:33,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:53:33,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:53:33,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:53:33,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:53:33,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:53:33,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:53:33,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:53:33,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:53:33,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:53:33,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:53:33,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:53:33,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:53:33,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:53:33,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:53:33,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:53:33,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:53:33,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:53:33,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:53:33,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:53:33,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:53:33,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:53:33,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:53:33,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:53:33,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:53:33,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:53:33,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:53:33,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:53:33,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:53:33,282 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:53:33,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:53:33,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:53:33,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:53:33,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:53:33,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:53:33,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:53:33,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:53:33,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:53:33,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:53:33,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:53:33,285 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:53:33,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:53:33,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:53:33,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:53:33,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:53:33,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:53:33,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:53:33,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:53:33,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:53:33,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:53:33,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:53:33,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:53:33,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:53:33,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:53:33,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:53:33,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:53:33,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:53:33,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:53:33,366 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:53:33,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_ptr_partial_init.i [2019-09-07 10:53:33,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b72c3b0/2283a4489e9e467bb9ffea83533d8a13/FLAG7fa4e7857 [2019-09-07 10:53:33,925 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:53:33,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_ptr_partial_init.i [2019-09-07 10:53:33,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b72c3b0/2283a4489e9e467bb9ffea83533d8a13/FLAG7fa4e7857 [2019-09-07 10:53:34,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b72c3b0/2283a4489e9e467bb9ffea83533d8a13 [2019-09-07 10:53:34,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:53:34,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:53:34,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:53:34,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:53:34,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:53:34,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9b56c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34, skipping insertion in model container [2019-09-07 10:53:34,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,338 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:53:34,357 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:53:34,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:53:34,608 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:53:34,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:53:34,748 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:53:34,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34 WrapperNode [2019-09-07 10:53:34,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:53:34,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:53:34,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:53:34,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:53:34,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... [2019-09-07 10:53:34,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:53:34,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:53:34,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:53:34,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:53:34,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:53:34,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:53:34,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:53:34,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:53:34,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:53:34,857 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 10:53:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:53:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:53:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:53:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 10:53:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-07 10:53:34,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-07 10:53:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:53:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:53:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:53:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:53:35,178 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:53:35,179 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:53:35,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:53:35 BoogieIcfgContainer [2019-09-07 10:53:35,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:53:35,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:53:35,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:53:35,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:53:35,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:53:34" (1/3) ... [2019-09-07 10:53:35,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347793df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:53:35, skipping insertion in model container [2019-09-07 10:53:35,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:53:34" (2/3) ... [2019-09-07 10:53:35,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347793df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:53:35, skipping insertion in model container [2019-09-07 10:53:35,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:53:35" (3/3) ... [2019-09-07 10:53:35,192 INFO L109 eAbstractionObserver]: Analyzing ICFG array_ptr_partial_init.i [2019-09-07 10:53:35,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:53:35,210 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:53:35,227 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:53:35,254 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:53:35,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:53:35,255 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:53:35,255 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:53:35,256 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:53:35,256 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:53:35,256 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:53:35,256 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:53:35,256 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:53:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 10:53:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:53:35,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:35,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:35,280 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-09-07 10:53:35,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:35,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:35,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:53:35,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:53:35,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:53:35,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:53:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:53:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:53:35,455 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 10:53:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:35,475 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-09-07 10:53:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:53:35,477 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:53:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:35,485 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:53:35,486 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 10:53:35,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:53:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 10:53:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 10:53:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:53:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 10:53:35,529 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-09-07 10:53:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:35,529 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 10:53:35,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:53:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 10:53:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:53:35,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:35,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:35,531 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-09-07 10:53:35,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:35,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:35,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:35,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:53:35,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:53:35,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:53:35,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:53:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:53:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:53:35,599 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-09-07 10:53:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:35,690 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-09-07 10:53:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:53:35,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:53:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:35,694 INFO L225 Difference]: With dead ends: 50 [2019-09-07 10:53:35,694 INFO L226 Difference]: Without dead ends: 36 [2019-09-07 10:53:35,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:53:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-07 10:53:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2019-09-07 10:53:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:53:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 10:53:35,711 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2019-09-07 10:53:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:35,711 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 10:53:35,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:53:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 10:53:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:53:35,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:35,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:35,715 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-09-07 10:53:35,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:35,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:35,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:53:35,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:35,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:35,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:35,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:53:35,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:53:35,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:35,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:53:35,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:53:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:53:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:53:35,947 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-09-07 10:53:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:36,080 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-07 10:53:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:53:36,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 10:53:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:36,083 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:53:36,085 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 10:53:36,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:53:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 10:53:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 28. [2019-09-07 10:53:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:53:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-07 10:53:36,096 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-09-07 10:53:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:36,097 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-07 10:53:36,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:53:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-07 10:53:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:53:36,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:36,098 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:36,099 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-09-07 10:53:36,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:36,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:53:36,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:36,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:53:36,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:53:36,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:36,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:53:36,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:53:36,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:53:36,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:53:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:53:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:53:36,279 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-09-07 10:53:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:36,398 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-09-07 10:53:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:53:36,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-07 10:53:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:36,400 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:53:36,400 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 10:53:36,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:53:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 10:53:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-09-07 10:53:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:53:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-07 10:53:36,409 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2019-09-07 10:53:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:36,410 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-07 10:53:36,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:53:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-07 10:53:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:53:36,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:36,412 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:36,412 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2019-09-07 10:53:36,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:36,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:36,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:53:36,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:36,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:53:36,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:53:36,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:36,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:53:36,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:53:36,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:36,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:53:36,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:53:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:53:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:53:36,620 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2019-09-07 10:53:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:36,734 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-09-07 10:53:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:53:36,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-07 10:53:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:36,735 INFO L225 Difference]: With dead ends: 97 [2019-09-07 10:53:36,736 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:53:36,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:53:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:53:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 36. [2019-09-07 10:53:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 10:53:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-07 10:53:36,744 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2019-09-07 10:53:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:36,744 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-07 10:53:36,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:53:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-07 10:53:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 10:53:36,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:36,746 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:36,746 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash 702132246, now seen corresponding path program 4 times [2019-09-07 10:53:36,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:36,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:36,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:53:36,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:36,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:53:36,865 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:36,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:53:36,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:36,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:53:36,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 10:53:36,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:36,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:53:36,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:53:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:53:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:53:36,946 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2019-09-07 10:53:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:37,076 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-09-07 10:53:37,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:53:37,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-07 10:53:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:37,078 INFO L225 Difference]: With dead ends: 113 [2019-09-07 10:53:37,079 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 10:53:37,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:53:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 10:53:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 40. [2019-09-07 10:53:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:53:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-07 10:53:37,086 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2019-09-07 10:53:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:37,087 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-07 10:53:37,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:53:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-07 10:53:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:53:37,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:37,088 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:37,089 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash -294189934, now seen corresponding path program 5 times [2019-09-07 10:53:37,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:37,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:37,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:37,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:53:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:37,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:37,216 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:53:37,369 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 10:53:37,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:37,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:53:37,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:53:37,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:37,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:53:37,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:53:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:53:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:53:37,402 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 9 states. [2019-09-07 10:53:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:37,566 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-09-07 10:53:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:53:37,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-09-07 10:53:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:37,569 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:53:37,570 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 10:53:37,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 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-09-07 10:53:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 10:53:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 44. [2019-09-07 10:53:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:53:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-07 10:53:37,593 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 35 [2019-09-07 10:53:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:37,593 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-07 10:53:37,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:53:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-07 10:53:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:53:37,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:37,596 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:37,597 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1966517006, now seen corresponding path program 6 times [2019-09-07 10:53:37,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:37,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:37,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:53:37,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:37,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:53:37,760 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-09-07 10:53:38,105 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:53:38,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:38,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:53:38,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:53:38,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:38,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:53:38,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:53:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:53:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:53:38,151 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 10 states. [2019-09-07 10:53:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:38,304 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2019-09-07 10:53:38,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:53:38,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-07 10:53:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:38,307 INFO L225 Difference]: With dead ends: 145 [2019-09-07 10:53:38,307 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 10:53:38,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 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-09-07 10:53:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 10:53:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 48. [2019-09-07 10:53:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:53:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-07 10:53:38,328 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 39 [2019-09-07 10:53:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:38,329 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-07 10:53:38,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:53:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-07 10:53:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:53:38,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:38,331 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:38,336 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1042523018, now seen corresponding path program 7 times [2019-09-07 10:53:38,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:38,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:38,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:38,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:38,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:53:38,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:38,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:38,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:38,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:53:38,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 10:53:38,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:38,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:53:38,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:53:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:53:38,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:53:38,590 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 11 states. [2019-09-07 10:53:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:38,777 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-09-07 10:53:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:53:38,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-09-07 10:53:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:38,779 INFO L225 Difference]: With dead ends: 161 [2019-09-07 10:53:38,779 INFO L226 Difference]: Without dead ends: 134 [2019-09-07 10:53:38,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:53:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-07 10:53:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 52. [2019-09-07 10:53:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:53:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-07 10:53:38,787 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 43 [2019-09-07 10:53:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:38,787 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-07 10:53:38,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:53:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-07 10:53:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:53:38,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:38,789 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:38,789 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2059988486, now seen corresponding path program 8 times [2019-09-07 10:53:38,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:38,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:38,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:38,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:38,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:53:38,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:38,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:38,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:53:39,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:53:39,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:39,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:53:39,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:53:39,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:39,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:53:39,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:53:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:53:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:53:39,065 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 12 states. [2019-09-07 10:53:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:39,255 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2019-09-07 10:53:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:53:39,256 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-09-07 10:53:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:39,258 INFO L225 Difference]: With dead ends: 177 [2019-09-07 10:53:39,259 INFO L226 Difference]: Without dead ends: 148 [2019-09-07 10:53:39,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:53:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-07 10:53:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 56. [2019-09-07 10:53:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:53:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-07 10:53:39,281 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 47 [2019-09-07 10:53:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:39,283 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-07 10:53:39,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:53:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-07 10:53:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:53:39,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:39,287 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:39,287 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1909355902, now seen corresponding path program 9 times [2019-09-07 10:53:39,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:39,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:53:39,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:39,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:53:39,490 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-09-07 10:53:40,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:53:40,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:40,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:53:40,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 10:53:40,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:40,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:53:40,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:53:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:53:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:53:40,317 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 13 states. [2019-09-07 10:53:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:40,504 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2019-09-07 10:53:40,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:53:40,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-09-07 10:53:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:40,506 INFO L225 Difference]: With dead ends: 193 [2019-09-07 10:53:40,507 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 10:53:40,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:53:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 10:53:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 60. [2019-09-07 10:53:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 10:53:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-07 10:53:40,514 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 51 [2019-09-07 10:53:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:40,515 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-07 10:53:40,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:53:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-07 10:53:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 10:53:40,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:40,516 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:40,516 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1930921730, now seen corresponding path program 10 times [2019-09-07 10:53:40,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:40,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:40,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:40,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:40,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:53:40,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:40,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:53:40,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:40,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:53:40,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:40,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:53:40,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 10:53:40,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:40,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:53:40,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:53:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:53:40,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:53:40,769 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 14 states. [2019-09-07 10:53:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:40,985 INFO L93 Difference]: Finished difference Result 209 states and 214 transitions. [2019-09-07 10:53:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:53:40,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-09-07 10:53:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:40,988 INFO L225 Difference]: With dead ends: 209 [2019-09-07 10:53:40,988 INFO L226 Difference]: Without dead ends: 176 [2019-09-07 10:53:40,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:53:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-07 10:53:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 64. [2019-09-07 10:53:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:53:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-07 10:53:40,995 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2019-09-07 10:53:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:40,996 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-07 10:53:40,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:53:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-07 10:53:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:53:40,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:40,997 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:40,997 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1124550278, now seen corresponding path program 11 times [2019-09-07 10:53:40,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:40,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:53:41,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:41,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:53:41,175 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:57,693 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-07 10:53:57,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:57,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:53:57,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:53:57,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:57,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:53:57,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:53:57,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:53:57,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:53:57,755 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 15 states. [2019-09-07 10:53:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:57,970 INFO L93 Difference]: Finished difference Result 225 states and 230 transitions. [2019-09-07 10:53:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:53:57,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-09-07 10:53:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:57,972 INFO L225 Difference]: With dead ends: 225 [2019-09-07 10:53:57,972 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 10:53:57,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:53:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 10:53:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 68. [2019-09-07 10:53:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 10:53:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-07 10:53:57,987 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 59 [2019-09-07 10:53:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:57,989 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-07 10:53:57,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:53:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-07 10:53:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:53:57,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:57,991 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:57,991 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash 367873014, now seen corresponding path program 12 times [2019-09-07 10:53:57,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:57,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:57,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:57,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:57,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:53:58,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:58,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:53:58,205 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:33,620 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:54:33,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:54:33,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:54:33,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 10:54:33,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:33,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:54:33,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:54:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:54:33,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:54:33,693 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 16 states. [2019-09-07 10:54:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:33,962 INFO L93 Difference]: Finished difference Result 241 states and 246 transitions. [2019-09-07 10:54:33,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:54:33,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-09-07 10:54:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:33,966 INFO L225 Difference]: With dead ends: 241 [2019-09-07 10:54:33,966 INFO L226 Difference]: Without dead ends: 204 [2019-09-07 10:54:33,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 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-09-07 10:54:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-07 10:54:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 72. [2019-09-07 10:54:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 10:54:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-07 10:54:33,975 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 63 [2019-09-07 10:54:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:33,975 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-07 10:54:33,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:54:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-07 10:54:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:54:33,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:33,977 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:33,977 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1060032398, now seen corresponding path program 13 times [2019-09-07 10:54:33,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:33,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:33,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:33,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:54:33,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 10:54:34,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:34,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:34,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:54:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:34,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:54:34,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:54:34,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:34,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:54:34,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:54:34,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:54:34,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:54:34,314 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 17 states. [2019-09-07 10:54:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:34,634 INFO L93 Difference]: Finished difference Result 257 states and 262 transitions. [2019-09-07 10:54:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:54:34,634 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-07 10:54:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:34,636 INFO L225 Difference]: With dead ends: 257 [2019-09-07 10:54:34,636 INFO L226 Difference]: Without dead ends: 218 [2019-09-07 10:54:34,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:54:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-07 10:54:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 76. [2019-09-07 10:54:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:54:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-07 10:54:34,643 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 67 [2019-09-07 10:54:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:34,643 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-07 10:54:34,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:54:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-07 10:54:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:54:34,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:34,644 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:34,645 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1741723922, now seen corresponding path program 14 times [2019-09-07 10:54:34,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:34,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:54:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:54:34,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:34,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:34,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:54:34,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:54:34,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:54:34,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:54:34,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:54:34,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:34,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:54:34,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:54:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:54:34,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:54:34,936 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 18 states. [2019-09-07 10:54:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:35,248 INFO L93 Difference]: Finished difference Result 273 states and 278 transitions. [2019-09-07 10:54:35,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:54:35,248 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2019-09-07 10:54:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:35,250 INFO L225 Difference]: With dead ends: 273 [2019-09-07 10:54:35,250 INFO L226 Difference]: Without dead ends: 232 [2019-09-07 10:54:35,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:54:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-07 10:54:35,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 80. [2019-09-07 10:54:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 10:54:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-09-07 10:54:35,256 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 71 [2019-09-07 10:54:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:35,257 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-09-07 10:54:35,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:54:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-09-07 10:54:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:54:35,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:35,258 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:35,258 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:35,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:35,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1475154070, now seen corresponding path program 15 times [2019-09-07 10:54:35,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:35,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:35,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:54:35,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 10:54:35,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:35,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:35,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:55:15,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 10:55:15,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:55:15,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:55:15,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:55:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 10:55:15,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:55:15,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:55:15,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:55:15,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:55:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:55:15,230 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 19 states. [2019-09-07 10:55:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:55:15,596 INFO L93 Difference]: Finished difference Result 289 states and 294 transitions. [2019-09-07 10:55:15,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:55:15,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-09-07 10:55:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:55:15,598 INFO L225 Difference]: With dead ends: 289 [2019-09-07 10:55:15,599 INFO L226 Difference]: Without dead ends: 246 [2019-09-07 10:55:15,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:55:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-07 10:55:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 84. [2019-09-07 10:55:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 10:55:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-07 10:55:15,607 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 75 [2019-09-07 10:55:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:55:15,607 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-07 10:55:15,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:55:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-07 10:55:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:55:15,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:55:15,608 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:55:15,608 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:55:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:55:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1375286810, now seen corresponding path program 16 times [2019-09-07 10:55:15,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:55:15,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:55:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:55:15,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:55:15,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:55:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:55:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 10:55:15,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:55:15,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:55:15,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:55:16,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:55:16,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:55:16,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:55:16,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:55:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 10:55:16,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:55:16,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:55:16,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:55:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:55:16,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:55:16,060 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 20 states. [2019-09-07 10:55:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:55:16,478 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2019-09-07 10:55:16,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:55:16,478 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2019-09-07 10:55:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:55:16,480 INFO L225 Difference]: With dead ends: 305 [2019-09-07 10:55:16,480 INFO L226 Difference]: Without dead ends: 260 [2019-09-07 10:55:16,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:55:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-07 10:55:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 88. [2019-09-07 10:55:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:55:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-07 10:55:16,487 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 79 [2019-09-07 10:55:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:55:16,488 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-07 10:55:16,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:55:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-07 10:55:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:55:16,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:55:16,489 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:55:16,489 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:55:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:55:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1726613918, now seen corresponding path program 17 times [2019-09-07 10:55:16,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:55:16,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:55:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:55:16,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:55:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:55:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:55:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 10:55:16,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:55:16,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:55:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:56:43,124 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-07 10:56:43,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:56:43,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:56:43,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:56:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 10:56:43,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:56:43,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:56:43,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:56:43,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:56:43,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:56:43,199 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 21 states. [2019-09-07 10:56:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:56:43,598 INFO L93 Difference]: Finished difference Result 321 states and 326 transitions. [2019-09-07 10:56:43,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:56:43,600 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2019-09-07 10:56:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:56:43,602 INFO L225 Difference]: With dead ends: 321 [2019-09-07 10:56:43,602 INFO L226 Difference]: Without dead ends: 274 [2019-09-07 10:56:43,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:56:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-07 10:56:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 92. [2019-09-07 10:56:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-07 10:56:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-07 10:56:43,608 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 83 [2019-09-07 10:56:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:56:43,609 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-07 10:56:43,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:56:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-07 10:56:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:56:43,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:56:43,610 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:56:43,610 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:56:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:56:43,611 INFO L82 PathProgramCache]: Analyzing trace with hash 164328670, now seen corresponding path program 18 times [2019-09-07 10:56:43,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:56:43,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:56:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:43,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:56:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:56:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 10:56:43,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:56:43,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:56:43,845 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:58:37,070 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:58:37,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:58:37,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:58:37,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:58:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 10:58:37,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:58:37,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:58:37,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:58:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:58:37,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:58:37,157 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 22 states. [2019-09-07 10:58:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:58:37,504 INFO L93 Difference]: Finished difference Result 337 states and 342 transitions. [2019-09-07 10:58:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:58:37,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-07 10:58:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:58:37,507 INFO L225 Difference]: With dead ends: 337 [2019-09-07 10:58:37,508 INFO L226 Difference]: Without dead ends: 288 [2019-09-07 10:58:37,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:58:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-07 10:58:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 96. [2019-09-07 10:58:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:58:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-07 10:58:37,514 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 87 [2019-09-07 10:58:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:58:37,514 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-07 10:58:37,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:58:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-07 10:58:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:58:37,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:58:37,515 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:58:37,516 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:58:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:58:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash -768457382, now seen corresponding path program 19 times [2019-09-07 10:58:37,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:58:37,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:58:37,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:58:37,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:58:37,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:58:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:58:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 10:58:37,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:58:37,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:58:37,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:58:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:58:37,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:58:37,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:58:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 10:58:37,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:58:37,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:58:37,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:58:37,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:58:37,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:58:37,855 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 23 states. [2019-09-07 10:58:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:58:38,265 INFO L93 Difference]: Finished difference Result 353 states and 358 transitions. [2019-09-07 10:58:38,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:58:38,268 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2019-09-07 10:58:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:58:38,271 INFO L225 Difference]: With dead ends: 353 [2019-09-07 10:58:38,271 INFO L226 Difference]: Without dead ends: 302 [2019-09-07 10:58:38,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:58:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-07 10:58:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 100. [2019-09-07 10:58:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 10:58:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-09-07 10:58:38,278 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 91 [2019-09-07 10:58:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:58:38,278 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-09-07 10:58:38,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:58:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-09-07 10:58:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:58:38,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:58:38,279 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:58:38,280 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:58:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:58:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1976920022, now seen corresponding path program 20 times [2019-09-07 10:58:38,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:58:38,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:58:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:58:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:58:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:58:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:58:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 10:58:38,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:58:38,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:58:38,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:58:38,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:58:38,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:58:38,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:58:38,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:58:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 10:58:38,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:58:38,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:58:38,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:58:38,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:58:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:58:38,648 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 24 states. [2019-09-07 10:58:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:58:39,070 INFO L93 Difference]: Finished difference Result 369 states and 374 transitions. [2019-09-07 10:58:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:58:39,074 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2019-09-07 10:58:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:58:39,076 INFO L225 Difference]: With dead ends: 369 [2019-09-07 10:58:39,076 INFO L226 Difference]: Without dead ends: 316 [2019-09-07 10:58:39,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 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-09-07 10:58:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-07 10:58:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 104. [2019-09-07 10:58:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 10:58:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-07 10:58:39,088 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 95 [2019-09-07 10:58:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:58:39,088 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-07 10:58:39,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:58:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-07 10:58:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:58:39,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:58:39,089 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:58:39,089 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:58:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:58:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1447044014, now seen corresponding path program 21 times [2019-09-07 10:58:39,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:58:39,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:58:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:58:39,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:58:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:58:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:58:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 10:58:39,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:58:39,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:58:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:00:06,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-07 11:00:06,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:00:06,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:00:06,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:00:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 11:00:06,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:00:06,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 11:00:06,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:00:06,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:00:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:00:06,816 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 25 states. [2019-09-07 11:00:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:00:07,234 INFO L93 Difference]: Finished difference Result 385 states and 390 transitions. [2019-09-07 11:00:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 11:00:07,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2019-09-07 11:00:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:00:07,237 INFO L225 Difference]: With dead ends: 385 [2019-09-07 11:00:07,237 INFO L226 Difference]: Without dead ends: 330 [2019-09-07 11:00:07,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 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-09-07 11:00:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-07 11:00:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 108. [2019-09-07 11:00:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-07 11:00:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-07 11:00:07,245 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 99 [2019-09-07 11:00:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:00:07,245 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-07 11:00:07,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:00:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-07 11:00:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 11:00:07,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:00:07,246 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:00:07,246 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:00:07,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:00:07,247 INFO L82 PathProgramCache]: Analyzing trace with hash -730029362, now seen corresponding path program 22 times [2019-09-07 11:00:07,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:00:07,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:00:07,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:07,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:00:07,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:00:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 11:00:07,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:00:07,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:00:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:00:07,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:00:07,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:00:07,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:00:07,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:00:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 11:00:07,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:00:07,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 11:00:07,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:00:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:00:07,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:00:07,818 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 26 states. [2019-09-07 11:00:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:00:08,345 INFO L93 Difference]: Finished difference Result 401 states and 406 transitions. [2019-09-07 11:00:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:00:08,345 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2019-09-07 11:00:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:00:08,347 INFO L225 Difference]: With dead ends: 401 [2019-09-07 11:00:08,348 INFO L226 Difference]: Without dead ends: 344 [2019-09-07 11:00:08,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:00:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-07 11:00:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 112. [2019-09-07 11:00:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 11:00:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-07 11:00:08,355 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 103 [2019-09-07 11:00:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:00:08,355 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-07 11:00:08,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:00:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-07 11:00:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 11:00:08,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:00:08,357 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:00:08,357 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:00:08,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:00:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1911112886, now seen corresponding path program 23 times [2019-09-07 11:00:08,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:00:08,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:00:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:08,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:00:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:00:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 11:00:08,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:00:08,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:00:08,712 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:35,051 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-07 11:02:35,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:35,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:02:35,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 11:02:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:35,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 11:02:35,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:02:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:02:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:02:35,175 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 27 states. [2019-09-07 11:02:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:35,775 INFO L93 Difference]: Finished difference Result 417 states and 422 transitions. [2019-09-07 11:02:35,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:02:35,775 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2019-09-07 11:02:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:35,777 INFO L225 Difference]: With dead ends: 417 [2019-09-07 11:02:35,778 INFO L226 Difference]: Without dead ends: 358 [2019-09-07 11:02:35,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:02:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-07 11:02:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 116. [2019-09-07 11:02:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 11:02:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-07 11:02:35,784 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 107 [2019-09-07 11:02:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:35,785 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-07 11:02:35,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:02:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-07 11:02:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 11:02:35,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:35,786 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:02:35,786 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash 538518982, now seen corresponding path program 24 times [2019-09-07 11:02:35,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:35,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:35,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 11:02:36,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:36,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:36,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:05:24,023 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 11:05:24,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:05:24,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:05:24,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:05:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-07 11:05:24,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:05:24,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 11:05:24,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:05:24,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:05:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:05:24,194 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 28 states. [2019-09-07 11:05:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:05:24,805 INFO L93 Difference]: Finished difference Result 433 states and 438 transitions. [2019-09-07 11:05:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:05:24,805 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2019-09-07 11:05:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:05:24,807 INFO L225 Difference]: With dead ends: 433 [2019-09-07 11:05:24,807 INFO L226 Difference]: Without dead ends: 372 [2019-09-07 11:05:24,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:05:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-07 11:05:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 120. [2019-09-07 11:05:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 11:05:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-09-07 11:05:24,818 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 111 [2019-09-07 11:05:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:05:24,818 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-09-07 11:05:24,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:05:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-09-07 11:05:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 11:05:24,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:05:24,820 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:05:24,820 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:05:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:05:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash 93250114, now seen corresponding path program 25 times [2019-09-07 11:05:24,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:05:24,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:05:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:24,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:05:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:05:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 11:05:25,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:05:25,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:05:25,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:05:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:05:25,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:05:25,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:05:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 11:05:25,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:05:25,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 11:05:25,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:05:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:05:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:05:25,458 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 29 states. [2019-09-07 11:05:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:05:25,999 INFO L93 Difference]: Finished difference Result 449 states and 454 transitions. [2019-09-07 11:05:26,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:05:26,000 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2019-09-07 11:05:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:05:26,001 INFO L225 Difference]: With dead ends: 449 [2019-09-07 11:05:26,002 INFO L226 Difference]: Without dead ends: 386 [2019-09-07 11:05:26,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:05:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-07 11:05:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 124. [2019-09-07 11:05:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 11:05:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-07 11:05:26,008 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 115 [2019-09-07 11:05:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:05:26,009 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-07 11:05:26,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:05:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-07 11:05:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 11:05:26,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:05:26,010 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:05:26,010 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:05:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:05:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1795354814, now seen corresponding path program 26 times [2019-09-07 11:05:26,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:05:26,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:05:26,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:26,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:05:26,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:05:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 11:05:26,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:05:26,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:05:26,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:05:26,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:05:26,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:05:26,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:05:26,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:05:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 11:05:26,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:05:26,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 11:05:26,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:05:26,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:05:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:05:26,735 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 30 states. [2019-09-07 11:05:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:05:27,431 INFO L93 Difference]: Finished difference Result 465 states and 470 transitions. [2019-09-07 11:05:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 11:05:27,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2019-09-07 11:05:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:05:27,434 INFO L225 Difference]: With dead ends: 465 [2019-09-07 11:05:27,435 INFO L226 Difference]: Without dead ends: 400 [2019-09-07 11:05:27,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:05:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-07 11:05:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 128. [2019-09-07 11:05:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 11:05:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-09-07 11:05:27,442 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 119 [2019-09-07 11:05:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:05:27,442 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-09-07 11:05:27,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:05:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-09-07 11:05:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 11:05:27,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:05:27,443 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:05:27,443 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:05:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:05:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1367322310, now seen corresponding path program 27 times [2019-09-07 11:05:27,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:05:27,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:05:27,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:27,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:05:27,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:05:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 11:05:27,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:05:27,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:05:27,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2