java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_running-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:25:37,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:25:37,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:25:37,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:25:37,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:25:37,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:25:37,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:25:37,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:25:37,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:25:37,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:25:37,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:25:37,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:25:37,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:25:37,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:25:37,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:25:37,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:25:37,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:25:37,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:25:37,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:25:37,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:25:37,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:25:37,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:25:37,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:25:37,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:25:37,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:25:37,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:25:37,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:25:37,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:25:37,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:25:37,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:25:37,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:25:37,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:25:37,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:25:37,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:25:37,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:25:37,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:25:37,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:25:37,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:25:37,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:25:37,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:25:37,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:25:37,389 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:25:37,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:25:37,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:25:37,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:25:37,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:25:37,417 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:25:37,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:25:37,418 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:25:37,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:25:37,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:25:37,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:25:37,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:25:37,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:25:37,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:25:37,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:25:37,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:25:37,421 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:25:37,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:25:37,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:25:37,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:25:37,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:25:37,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:25:37,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:25:37,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:25:37,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:25:37,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:25:37,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:25:37,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:25:37,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:25:37,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:25:37,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:25:37,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:25:37,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:25:37,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:25:37,501 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:25:37,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_running-2.i [2019-09-07 10:25:37,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdef14d97/5243cc629aa144d0b9783221c786b494/FLAG3b93bdf1a [2019-09-07 10:25:37,933 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:25:37,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_running-2.i [2019-09-07 10:25:37,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdef14d97/5243cc629aa144d0b9783221c786b494/FLAG3b93bdf1a [2019-09-07 10:25:38,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdef14d97/5243cc629aa144d0b9783221c786b494 [2019-09-07 10:25:38,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:25:38,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:25:38,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:25:38,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:25:38,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:25:38,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfb511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38, skipping insertion in model container [2019-09-07 10:25:38,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:25:38,358 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:25:38,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:25:38,587 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:25:38,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:25:38,648 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:25:38,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38 WrapperNode [2019-09-07 10:25:38,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:25:38,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:25:38,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:25:38,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:25:38,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (1/1) ... [2019-09-07 10:25:38,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:25:38,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:25:38,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:25:38,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:25:38,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (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:25:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:25:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:25:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:25:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:25:38,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:25:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:25:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:25:39,122 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:25:39,122 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:25:39,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:25:39 BoogieIcfgContainer [2019-09-07 10:25:39,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:25:39,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:25:39,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:25:39,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:25:39,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:25:38" (1/3) ... [2019-09-07 10:25:39,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288f45f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:25:39, skipping insertion in model container [2019-09-07 10:25:39,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:25:38" (2/3) ... [2019-09-07 10:25:39,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288f45f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:25:39, skipping insertion in model container [2019-09-07 10:25:39,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:25:39" (3/3) ... [2019-09-07 10:25:39,132 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_running-2.i [2019-09-07 10:25:39,142 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:25:39,149 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:25:39,172 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:25:39,199 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:25:39,199 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:25:39,200 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:25:39,200 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:25:39,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:25:39,200 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:25:39,200 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:25:39,200 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:25:39,201 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:25:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-07 10:25:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:25:39,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:39,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:39,224 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash -766370701, now seen corresponding path program 1 times [2019-09-07 10:25:39,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:39,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:39,363 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:25:39,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:25:39,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:25:39,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:25:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:25:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:25:39,379 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-07 10:25:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:39,400 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2019-09-07 10:25:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:25:39,401 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:25:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:39,409 INFO L225 Difference]: With dead ends: 56 [2019-09-07 10:25:39,410 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:25:39,412 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:25:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:25:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-07 10:25:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:25:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-09-07 10:25:39,442 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2019-09-07 10:25:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:39,442 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-09-07 10:25:39,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:25:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2019-09-07 10:25:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:25:39,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:39,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:39,444 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash 288109956, now seen corresponding path program 1 times [2019-09-07 10:25:39,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:39,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:39,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:39,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:39,503 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:25:39,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:25:39,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:25:39,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:25:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:25:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:25:39,506 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2019-09-07 10:25:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:39,602 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-09-07 10:25:39,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:25:39,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:25:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:39,604 INFO L225 Difference]: With dead ends: 54 [2019-09-07 10:25:39,604 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:25:39,605 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:25:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:25:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-09-07 10:25:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:25:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-09-07 10:25:39,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-09-07 10:25:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:39,615 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-09-07 10:25:39,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:25:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-09-07 10:25:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:25:39,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:39,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:39,617 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1452110141, now seen corresponding path program 1 times [2019-09-07 10:25:39,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:39,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:25:39,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:25:39,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 10:25:39,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:25:39,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:25:39,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:25:39,753 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2019-09-07 10:25:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:39,874 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-09-07 10:25:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:25:39,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-07 10:25:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:39,876 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:25:39,876 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 10:25:39,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:25:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 10:25:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-07 10:25:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:25:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-09-07 10:25:39,888 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2019-09-07 10:25:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:39,889 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-09-07 10:25:39,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:25:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-09-07 10:25:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:25:39,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:39,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:39,892 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1877196419, now seen corresponding path program 1 times [2019-09-07 10:25:39,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:39,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:25:39,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:39,981 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:25:39,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:40,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:25:40,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:25:40,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:40,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:25:40,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:25:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:25:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:25:40,095 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 5 states. [2019-09-07 10:25:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:40,189 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2019-09-07 10:25:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:25:40,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-07 10:25:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:40,191 INFO L225 Difference]: With dead ends: 84 [2019-09-07 10:25:40,191 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 10:25:40,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:25:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 10:25:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2019-09-07 10:25:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:25:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2019-09-07 10:25:40,200 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 27 [2019-09-07 10:25:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:40,201 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2019-09-07 10:25:40,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:25:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2019-09-07 10:25:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:25:40,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:40,203 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:40,203 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:40,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1355439264, now seen corresponding path program 2 times [2019-09-07 10:25:40,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:40,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:40,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:40,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 10:25:40,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:40,281 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) [2019-09-07 10:25:40,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:40,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:25:40,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:40,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:25:40,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 10:25:40,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:40,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:25:40,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:25:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:25:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:25:40,354 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 6 states. [2019-09-07 10:25:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:40,459 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2019-09-07 10:25:40,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:25:40,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-09-07 10:25:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:40,461 INFO L225 Difference]: With dead ends: 114 [2019-09-07 10:25:40,461 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 10:25:40,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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:25:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 10:25:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2019-09-07 10:25:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:25:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2019-09-07 10:25:40,470 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 39 [2019-09-07 10:25:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:40,471 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2019-09-07 10:25:40,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:25:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2019-09-07 10:25:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:25:40,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:40,473 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:40,473 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1296674585, now seen corresponding path program 3 times [2019-09-07 10:25:40,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:40,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:40,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:25:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:25:40,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:40,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:25:40,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:40,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:25:40,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:40,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:25:40,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:40,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:25:40,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:40,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:40,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:40,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:25:40,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-09-07 10:25:40,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:40,738 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2019-09-07 10:25:40,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 10:25:40,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-09-07 10:25:40,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:25:40,989 INFO L341 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2019-09-07 10:25:40,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2019-09-07 10:25:40,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:25:40,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:25:40,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:41,026 INFO L567 ElimStorePlain]: treesize reduction 2, result has 93.3 percent of original size [2019-09-07 10:25:41,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 10:25:41,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2019-09-07 10:25:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 10:25:41,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:41,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2019-09-07 10:25:41,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:25:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:25:41,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:25:41,153 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 15 states. [2019-09-07 10:25:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:43,367 INFO L93 Difference]: Finished difference Result 248 states and 357 transitions. [2019-09-07 10:25:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:25:43,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-09-07 10:25:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:43,372 INFO L225 Difference]: With dead ends: 248 [2019-09-07 10:25:43,372 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 10:25:43,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=634, Invalid=1916, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:25:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 10:25:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 178. [2019-09-07 10:25:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 10:25:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2019-09-07 10:25:43,393 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 51 [2019-09-07 10:25:43,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:43,393 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2019-09-07 10:25:43,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:25:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2019-09-07 10:25:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:25:43,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:43,397 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:43,397 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1040797544, now seen corresponding path program 1 times [2019-09-07 10:25:43,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:43,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:43,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:43,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:25:43,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-07 10:25:43,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:43,607 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:25:43,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:43,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:25:43,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-07 10:25:43,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:43,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:25:43,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:25:43,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:25:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:25:43,715 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand 10 states. [2019-09-07 10:25:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:43,915 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2019-09-07 10:25:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:25:43,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-07 10:25:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:43,919 INFO L225 Difference]: With dead ends: 399 [2019-09-07 10:25:43,919 INFO L226 Difference]: Without dead ends: 240 [2019-09-07 10:25:43,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 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:25:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-07 10:25:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 205. [2019-09-07 10:25:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 10:25:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 285 transitions. [2019-09-07 10:25:43,966 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 285 transitions. Word has length 87 [2019-09-07 10:25:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:43,967 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 285 transitions. [2019-09-07 10:25:43,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:25:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 285 transitions. [2019-09-07 10:25:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:25:43,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:43,970 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:43,970 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:43,971 INFO L82 PathProgramCache]: Analyzing trace with hash 370428881, now seen corresponding path program 2 times [2019-09-07 10:25:43,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:43,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:43,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-09-07 10:25:44,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:44,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:25:44,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:44,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:25:44,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:44,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:25:44,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:25:44,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:44,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:25:44,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:25:44,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:25:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:25:44,235 INFO L87 Difference]: Start difference. First operand 205 states and 285 transitions. Second operand 11 states. [2019-09-07 10:25:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:44,390 INFO L93 Difference]: Finished difference Result 451 states and 638 transitions. [2019-09-07 10:25:44,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:25:44,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-07 10:25:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:44,393 INFO L225 Difference]: With dead ends: 451 [2019-09-07 10:25:44,393 INFO L226 Difference]: Without dead ends: 267 [2019-09-07 10:25:44,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 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:25:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-07 10:25:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 232. [2019-09-07 10:25:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 10:25:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2019-09-07 10:25:44,408 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 99 [2019-09-07 10:25:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:44,409 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2019-09-07 10:25:44,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:25:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2019-09-07 10:25:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:25:44,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:44,412 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:44,412 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:44,412 INFO L82 PathProgramCache]: Analyzing trace with hash 855562356, now seen corresponding path program 3 times [2019-09-07 10:25:44,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:44,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:44,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:44,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:25:44,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-07 10:25:44,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:44,536 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:25:44,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:44,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:25:44,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:44,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:25:44,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:44,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 10:25:44,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:44,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:44,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:44,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-07 10:25:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:25:44,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:44,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2019-09-07 10:25:44,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:25:44,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:44,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:44,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2019-09-07 10:25:44,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:44,826 INFO L567 ElimStorePlain]: treesize reduction 1, result has 97.2 percent of original size [2019-09-07 10:25:44,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 10:25:44,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:18 [2019-09-07 10:25:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-07 10:25:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:44,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-07 10:25:44,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:25:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:25:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:25:44,991 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand 18 states. [2019-09-07 10:25:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:46,152 INFO L93 Difference]: Finished difference Result 565 states and 805 transitions. [2019-09-07 10:25:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:25:46,152 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2019-09-07 10:25:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:46,155 INFO L225 Difference]: With dead ends: 565 [2019-09-07 10:25:46,155 INFO L226 Difference]: Without dead ends: 356 [2019-09-07 10:25:46,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=737, Invalid=1713, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:25:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-07 10:25:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 313. [2019-09-07 10:25:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-07 10:25:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 437 transitions. [2019-09-07 10:25:46,172 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 437 transitions. Word has length 111 [2019-09-07 10:25:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:46,173 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 437 transitions. [2019-09-07 10:25:46,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:25:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 437 transitions. [2019-09-07 10:25:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 10:25:46,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:46,191 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:46,191 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash -289431669, now seen corresponding path program 1 times [2019-09-07 10:25:46,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:46,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:46,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:25:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-09-07 10:25:46,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:46,370 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:25:46,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:46,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:25:46,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:25:46,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:46,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:25:46,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:25:46,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:25:46,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:25:46,491 INFO L87 Difference]: Start difference. First operand 313 states and 437 transitions. Second operand 15 states. [2019-09-07 10:25:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:46,746 INFO L93 Difference]: Finished difference Result 659 states and 934 transitions. [2019-09-07 10:25:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:25:46,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-09-07 10:25:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:46,750 INFO L225 Difference]: With dead ends: 659 [2019-09-07 10:25:46,750 INFO L226 Difference]: Without dead ends: 375 [2019-09-07 10:25:46,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:25:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-07 10:25:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2019-09-07 10:25:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 10:25:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 475 transitions. [2019-09-07 10:25:46,766 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 475 transitions. Word has length 147 [2019-09-07 10:25:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:46,766 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 475 transitions. [2019-09-07 10:25:46,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:25:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 475 transitions. [2019-09-07 10:25:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 10:25:46,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:46,769 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:46,769 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1631364946, now seen corresponding path program 2 times [2019-09-07 10:25:46,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:46,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:46,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:46,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-07 10:25:46,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:46,952 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:25:46,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:25:47,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:25:47,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:47,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:25:47,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:25:47,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:25:47,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:25:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:25:47,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:25:47,092 INFO L87 Difference]: Start difference. First operand 340 states and 475 transitions. Second operand 16 states. [2019-09-07 10:25:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:47,332 INFO L93 Difference]: Finished difference Result 711 states and 1008 transitions. [2019-09-07 10:25:47,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:25:47,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2019-09-07 10:25:47,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:47,335 INFO L225 Difference]: With dead ends: 711 [2019-09-07 10:25:47,335 INFO L226 Difference]: Without dead ends: 402 [2019-09-07 10:25:47,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:25:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-07 10:25:47,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 367. [2019-09-07 10:25:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-07 10:25:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 513 transitions. [2019-09-07 10:25:47,351 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 513 transitions. Word has length 159 [2019-09-07 10:25:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:47,352 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 513 transitions. [2019-09-07 10:25:47,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:25:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 513 transitions. [2019-09-07 10:25:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 10:25:47,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:47,354 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:47,354 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash 960967463, now seen corresponding path program 3 times [2019-09-07 10:25:47,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:47,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:47,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:47,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:25:47,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2019-09-07 10:25:47,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:47,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:47,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:25:47,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:25:47,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:47,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:25:47,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:47,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:25:47,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:47,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:47,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:47,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-09-07 10:25:47,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-07 10:25:47,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:47,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:47,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:47,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-09-07 10:25:47,873 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-07 10:25:47,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2019-09-07 10:25:47,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:47,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:47,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-07 10:25:47,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-09-07 10:25:50,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:25:50,177 INFO L341 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2019-09-07 10:25:50,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2019-09-07 10:25:50,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:25:50,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:50,201 INFO L567 ElimStorePlain]: treesize reduction 2, result has 92.9 percent of original size [2019-09-07 10:25:50,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-09-07 10:25:50,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:8 [2019-09-07 10:25:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 45 proven. 156 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2019-09-07 10:25:50,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:50,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-09-07 10:25:50,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:25:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:25:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=584, Unknown=1, NotChecked=0, Total=812 [2019-09-07 10:25:50,471 INFO L87 Difference]: Start difference. First operand 367 states and 513 transitions. Second operand 29 states. [2019-09-07 10:26:35,461 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-07 10:27:10,042 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-07 10:30:27,401 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-07 10:32:04,499 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 10:32:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:34,925 INFO L93 Difference]: Finished difference Result 1127 states and 1597 transitions. [2019-09-07 10:32:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-07 10:32:34,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 171 [2019-09-07 10:32:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:34,931 INFO L225 Difference]: With dead ends: 1127 [2019-09-07 10:32:34,931 INFO L226 Difference]: Without dead ends: 793 [2019-09-07 10:32:34,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 159 SyntacticMatches, 7 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12477 ImplicationChecksByTransitivity, 313.8s TimeCoverageRelationStatistics Valid=5909, Invalid=25195, Unknown=48, NotChecked=0, Total=31152 [2019-09-07 10:32:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-09-07 10:32:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 658. [2019-09-07 10:32:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-07 10:32:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 932 transitions. [2019-09-07 10:32:34,993 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 932 transitions. Word has length 171 [2019-09-07 10:32:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:34,993 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 932 transitions. [2019-09-07 10:32:34,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:32:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 932 transitions. [2019-09-07 10:32:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-07 10:32:34,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:34,997 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 16, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:34,997 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 106085599, now seen corresponding path program 4 times [2019-09-07 10:32:34,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:34,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:35,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:35,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:35,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 1394 trivial. 0 not checked. [2019-09-07 10:32:35,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:35,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:32:35,371 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:32:35,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:32:35,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:32:35,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-07 10:32:35,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:32:35,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 10:32:35,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:35,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:35,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:32:35,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-07 10:32:35,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:32:35,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-09-07 10:32:35,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:32:35,699 INFO L567 ElimStorePlain]: treesize reduction 30, result has 44.4 percent of original size [2019-09-07 10:32:35,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 10:32:35,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-09-07 10:32:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:32:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 142 proven. 1250 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-07 10:32:36,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:32:36,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 38] total 55 [2019-09-07 10:32:36,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:32:36,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:32:36,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=2356, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:32:36,874 INFO L87 Difference]: Start difference. First operand 658 states and 932 transitions. Second operand 55 states. [2019-09-07 10:32:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:32:42,705 INFO L93 Difference]: Finished difference Result 1854 states and 2663 transitions. [2019-09-07 10:32:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-07 10:32:42,706 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 219 [2019-09-07 10:32:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:32:42,715 INFO L225 Difference]: With dead ends: 1854 [2019-09-07 10:32:42,715 INFO L226 Difference]: Without dead ends: 1237 [2019-09-07 10:32:42,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3220 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1263, Invalid=8049, Unknown=0, NotChecked=0, Total=9312 [2019-09-07 10:32:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2019-09-07 10:32:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1060. [2019-09-07 10:32:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-09-07 10:32:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1515 transitions. [2019-09-07 10:32:42,763 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1515 transitions. Word has length 219 [2019-09-07 10:32:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:32:42,764 INFO L475 AbstractCegarLoop]: Abstraction has 1060 states and 1515 transitions. [2019-09-07 10:32:42,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:32:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1515 transitions. [2019-09-07 10:32:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-07 10:32:42,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:32:42,768 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 17, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:32:42,769 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:32:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:32:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1474351298, now seen corresponding path program 5 times [2019-09-07 10:32:42,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:32:42,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:32:42,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:42,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:32:42,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:32:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:32:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-09-07 10:32:43,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:32:43,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:32:43,153 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:33:32,914 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 10:33:32,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:32,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:33:32,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 1413 trivial. 0 not checked. [2019-09-07 10:33:33,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:33,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:33:33,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:33:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:33:33,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:33:33,034 INFO L87 Difference]: Start difference. First operand 1060 states and 1515 transitions. Second operand 22 states. [2019-09-07 10:33:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:33,362 INFO L93 Difference]: Finished difference Result 2208 states and 3177 transitions. [2019-09-07 10:33:33,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:33:33,362 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2019-09-07 10:33:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:33,369 INFO L225 Difference]: With dead ends: 2208 [2019-09-07 10:33:33,369 INFO L226 Difference]: Without dead ends: 1191 [2019-09-07 10:33:33,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:33:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2019-09-07 10:33:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1107. [2019-09-07 10:33:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2019-09-07 10:33:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1582 transitions. [2019-09-07 10:33:33,415 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1582 transitions. Word has length 231 [2019-09-07 10:33:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:33,415 INFO L475 AbstractCegarLoop]: Abstraction has 1107 states and 1582 transitions. [2019-09-07 10:33:33,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:33:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1582 transitions. [2019-09-07 10:33:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-07 10:33:33,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:33,420 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 18, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:33,420 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2021156229, now seen corresponding path program 6 times [2019-09-07 10:33:33,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:33,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:33,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 1748 trivial. 0 not checked. [2019-09-07 10:33:33,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:33,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:33,804 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:33:33,926 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:33:33,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:33,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:33:33,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:33,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 10:33:33,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:33:33,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:33:33,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:33:33,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:33:34,003 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-07 10:33:34,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2019-09-07 10:33:34,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:33:34,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:33:34,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:33:34,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-09-07 10:33:34,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:33:34,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:33:34,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:33:34,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 51 [2019-09-07 10:33:34,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:33:34,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:33:34,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:33:34,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:33:34,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:33:34,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 51 [2019-09-07 10:33:34,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 10:33:34,227 INFO L567 ElimStorePlain]: treesize reduction 1, result has 97.7 percent of original size [2019-09-07 10:33:34,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-09-07 10:33:34,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:87, output treesize:17 [2019-09-07 10:33:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 89 proven. 180 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2019-09-07 10:33:34,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:34,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2019-09-07 10:33:34,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:33:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:33:34,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=693, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:33:34,552 INFO L87 Difference]: Start difference. First operand 1107 states and 1582 transitions. Second operand 33 states. [2019-09-07 10:33:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:42,032 INFO L93 Difference]: Finished difference Result 2647 states and 3805 transitions. [2019-09-07 10:33:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-07 10:33:42,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 243 [2019-09-07 10:33:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:42,040 INFO L225 Difference]: With dead ends: 2647 [2019-09-07 10:33:42,040 INFO L226 Difference]: Without dead ends: 1585 [2019-09-07 10:33:42,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7772 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5032, Invalid=17618, Unknown=0, NotChecked=0, Total=22650 [2019-09-07 10:33:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-09-07 10:33:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1360. [2019-09-07 10:33:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-09-07 10:33:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1946 transitions. [2019-09-07 10:33:42,108 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1946 transitions. Word has length 243 [2019-09-07 10:33:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:42,109 INFO L475 AbstractCegarLoop]: Abstraction has 1360 states and 1946 transitions. [2019-09-07 10:33:42,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:33:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1946 transitions. [2019-09-07 10:33:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-07 10:33:42,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:42,114 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:42,115 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:42,115 INFO L82 PathProgramCache]: Analyzing trace with hash -807980303, now seen corresponding path program 4 times [2019-09-07 10:33:42,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:42,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:42,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 2576 trivial. 0 not checked. [2019-09-07 10:33:42,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:42,572 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:33:42,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:33:42,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:33:42,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:42,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:33:42,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 2576 trivial. 0 not checked. [2019-09-07 10:33:42,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:42,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:33:42,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:33:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:33:42,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:33:42,891 INFO L87 Difference]: Start difference. First operand 1360 states and 1946 transitions. Second operand 27 states. [2019-09-07 10:33:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:43,403 INFO L93 Difference]: Finished difference Result 2869 states and 4133 transitions. [2019-09-07 10:33:43,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:33:43,403 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2019-09-07 10:33:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:43,410 INFO L225 Difference]: With dead ends: 2869 [2019-09-07 10:33:43,411 INFO L226 Difference]: Without dead ends: 1562 [2019-09-07 10:33:43,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 291 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 10:33:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-09-07 10:33:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1418. [2019-09-07 10:33:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-09-07 10:33:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2029 transitions. [2019-09-07 10:33:43,472 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2029 transitions. Word has length 291 [2019-09-07 10:33:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:43,472 INFO L475 AbstractCegarLoop]: Abstraction has 1418 states and 2029 transitions. [2019-09-07 10:33:43,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:33:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2029 transitions. [2019-09-07 10:33:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-07 10:33:43,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:43,476 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:43,477 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:43,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1495141996, now seen corresponding path program 5 times [2019-09-07 10:33:43,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:43,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:43,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:43,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:43,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 2808 trivial. 0 not checked. [2019-09-07 10:33:43,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:43,963 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) [2019-09-07 10:33:43,982 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:45,000 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 10:35:45,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:45,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:35:45,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 2808 trivial. 0 not checked. [2019-09-07 10:35:45,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:45,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:35:45,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:35:45,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:35:45,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:35:45,140 INFO L87 Difference]: Start difference. First operand 1418 states and 2029 transitions. Second operand 28 states. [2019-09-07 10:35:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:45,632 INFO L93 Difference]: Finished difference Result 2983 states and 4297 transitions. [2019-09-07 10:35:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:35:45,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2019-09-07 10:35:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:45,639 INFO L225 Difference]: With dead ends: 2983 [2019-09-07 10:35:45,639 INFO L226 Difference]: Without dead ends: 1620 [2019-09-07 10:35:45,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 303 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 10:35:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2019-09-07 10:35:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1476. [2019-09-07 10:35:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-09-07 10:35:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2112 transitions. [2019-09-07 10:35:45,704 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2112 transitions. Word has length 303 [2019-09-07 10:35:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:45,704 INFO L475 AbstractCegarLoop]: Abstraction has 1476 states and 2112 transitions. [2019-09-07 10:35:45,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:35:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2112 transitions. [2019-09-07 10:35:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-07 10:35:45,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:45,710 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 23, 23, 23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:45,710 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1561568627, now seen corresponding path program 6 times [2019-09-07 10:35:45,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:45,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2019-09-07 10:35:46,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:46,157 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:35:46,168 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:35:48,021 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 10:35:48,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:48,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:35:48,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:48,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:35:48,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:48,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:48,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:48,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-09-07 10:35:48,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-07 10:35:48,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:48,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:48,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:48,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-09-07 10:35:48,171 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-07 10:35:48,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2019-09-07 10:35:48,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:48,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:48,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:48,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-07 10:35:48,356 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-09-07 10:35:48,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2019-09-07 10:35:48,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:48,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:48,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-07 10:35:48,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-09-07 10:35:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:35:52,792 INFO L341 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2019-09-07 10:35:52,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 47 [2019-09-07 10:35:52,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:35:52,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:52,832 INFO L567 ElimStorePlain]: treesize reduction 2, result has 92.9 percent of original size [2019-09-07 10:35:52,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-09-07 10:35:52,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:75, output treesize:8 [2019-09-07 10:35:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 156 proven. 474 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2019-09-07 10:35:53,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:53,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18] total 44 [2019-09-07 10:35:53,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:35:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:35:53,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=1310, Unknown=2, NotChecked=0, Total=1892 [2019-09-07 10:35:53,667 INFO L87 Difference]: Start difference. First operand 1476 states and 2112 transitions. Second operand 44 states. [2019-09-07 10:36:27,218 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:36:48,841 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:37:21,229 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 10:37:43,461 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 10:38:17,897 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:38:42,113 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:39:18,650 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:40:07,302 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 54