java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/zero_sum5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:32,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:32,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:32,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:32,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:32,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:32,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:32,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:32,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:32,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:32,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:32,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:32,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:32,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:32,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:32,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:32,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:32,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:32,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:32,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:32,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:32,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:32,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:32,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:32,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:32,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:32,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:32,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:32,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:32,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:32,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:32,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:32,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:32,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:32,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:32,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:32,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:32,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:32,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:32,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:32,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:32,280 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-20 12:59:32,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:32,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:32,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:32,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:32,306 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:32,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:32,307 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:32,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:32,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:32,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:32,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:32,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:32,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:32,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:32,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:32,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:32,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:32,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:32,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:32,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:32,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:32,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:32,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:32,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:32,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:32,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:32,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:32,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:32,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:32,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:32,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:32,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:32,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:32,364 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:32,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum5.c [2019-09-20 12:59:32,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93699e787/66e1259707834c32bddd3146052639ff/FLAG0dcd99f2f [2019-09-20 12:59:32,814 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:32,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum5.c [2019-09-20 12:59:32,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93699e787/66e1259707834c32bddd3146052639ff/FLAG0dcd99f2f [2019-09-20 12:59:33,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93699e787/66e1259707834c32bddd3146052639ff [2019-09-20 12:59:33,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:33,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:33,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:33,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:33,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:33,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de0b607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33, skipping insertion in model container [2019-09-20 12:59:33,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,249 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:33,268 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:33,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:33,484 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:33,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:33,626 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:33,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33 WrapperNode [2019-09-20 12:59:33,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:33,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:33,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:33,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:33,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (1/1) ... [2019-09-20 12:59:33,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:33,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:33,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:33,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:33,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (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-20 12:59:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:59:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:59:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:59:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-09-20 12:59:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 12:59:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 12:59:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 12:59:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:59:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:34,064 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:34,064 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-09-20 12:59:34,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:34 BoogieIcfgContainer [2019-09-20 12:59:34,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:34,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:34,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:34,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:34,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:33" (1/3) ... [2019-09-20 12:59:34,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f872486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:34, skipping insertion in model container [2019-09-20 12:59:34,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:33" (2/3) ... [2019-09-20 12:59:34,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f872486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:34, skipping insertion in model container [2019-09-20 12:59:34,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:34" (3/3) ... [2019-09-20 12:59:34,081 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum5.c [2019-09-20 12:59:34,098 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:34,112 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:34,128 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:34,158 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:34,159 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:34,159 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:34,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:34,160 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:34,160 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:34,160 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:34,160 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:34,160 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-09-20 12:59:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:34,181 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:34,182 INFO L407 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, 1, 1, 1, 1, 1] [2019-09-20 12:59:34,184 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash -298961335, now seen corresponding path program 1 times [2019-09-20 12:59:34,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:34,333 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-20 12:59:34,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:34,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:59:34,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:59:34,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:59:34,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:34,355 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-09-20 12:59:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:34,379 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2019-09-20 12:59:34,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:59:34,381 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-20 12:59:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:34,390 INFO L225 Difference]: With dead ends: 95 [2019-09-20 12:59:34,390 INFO L226 Difference]: Without dead ends: 44 [2019-09-20 12:59:34,394 INFO L636 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-20 12:59:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-20 12:59:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-20 12:59:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 12:59:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-09-20 12:59:34,436 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 32 [2019-09-20 12:59:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:34,436 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-09-20 12:59:34,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:59:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-09-20 12:59:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:34,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:34,439 INFO L407 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, 1, 1, 1, 1, 1] [2019-09-20 12:59:34,439 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash 351831333, now seen corresponding path program 1 times [2019-09-20 12:59:34,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:34,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:34,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:34,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:34,598 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-20 12:59:34,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:34,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:34,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:34,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:34,602 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 5 states. [2019-09-20 12:59:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:34,697 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2019-09-20 12:59:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:34,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-20 12:59:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:34,699 INFO L225 Difference]: With dead ends: 68 [2019-09-20 12:59:34,699 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 12:59:34,700 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 12:59:34,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-20 12:59:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-20 12:59:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2019-09-20 12:59:34,711 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 32 [2019-09-20 12:59:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:34,712 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2019-09-20 12:59:34,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2019-09-20 12:59:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 12:59:34,714 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:34,714 INFO L407 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:34,714 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash 615337315, now seen corresponding path program 1 times [2019-09-20 12:59:34,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:34,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:34,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:34,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:34,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:34,795 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 3 states. [2019-09-20 12:59:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:34,894 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2019-09-20 12:59:34,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:34,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 12:59:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:34,896 INFO L225 Difference]: With dead ends: 119 [2019-09-20 12:59:34,897 INFO L226 Difference]: Without dead ends: 65 [2019-09-20 12:59:34,900 INFO L636 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-20 12:59:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-20 12:59:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-20 12:59:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 12:59:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-09-20 12:59:34,918 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 34 [2019-09-20 12:59:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:34,920 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-09-20 12:59:34,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-09-20 12:59:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 12:59:34,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:34,922 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:34,923 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:34,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:34,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1838268449, now seen corresponding path program 1 times [2019-09-20 12:59:34,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:34,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:34,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:34,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 12:59:35,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:35,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:35,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:35,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:35,016 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 4 states. [2019-09-20 12:59:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:35,178 INFO L93 Difference]: Finished difference Result 114 states and 150 transitions. [2019-09-20 12:59:35,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:35,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-09-20 12:59:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:35,180 INFO L225 Difference]: With dead ends: 114 [2019-09-20 12:59:35,180 INFO L226 Difference]: Without dead ends: 65 [2019-09-20 12:59:35,181 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-20 12:59:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2019-09-20 12:59:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 12:59:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-09-20 12:59:35,190 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 36 [2019-09-20 12:59:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:35,193 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-09-20 12:59:35,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-09-20 12:59:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 12:59:35,195 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:35,196 INFO L407 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, 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-20 12:59:35,196 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:35,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1356508047, now seen corresponding path program 1 times [2019-09-20 12:59:35,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:35,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:35,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:35,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:35,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 12:59:35,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:35,348 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:35,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:35,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:59:35,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 12:59:35,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:35,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-20 12:59:35,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:35,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:35,498 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2019-09-20 12:59:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:35,578 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2019-09-20 12:59:35,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:35,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-09-20 12:59:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:35,580 INFO L225 Difference]: With dead ends: 103 [2019-09-20 12:59:35,581 INFO L226 Difference]: Without dead ends: 58 [2019-09-20 12:59:35,581 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-20 12:59:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-20 12:59:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-20 12:59:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-09-20 12:59:35,595 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 54 [2019-09-20 12:59:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:35,597 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-09-20 12:59:35,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-09-20 12:59:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 12:59:35,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:35,599 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 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, 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-20 12:59:35,600 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1231531187, now seen corresponding path program 2 times [2019-09-20 12:59:35,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:35,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-20 12:59:35,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:35,702 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:35,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:35,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:35,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:35,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:59:35,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-20 12:59:35,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:35,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-20 12:59:35,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:59:35,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:59:35,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:35,822 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 7 states. [2019-09-20 12:59:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:36,047 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2019-09-20 12:59:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:36,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-20 12:59:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:36,050 INFO L225 Difference]: With dead ends: 128 [2019-09-20 12:59:36,050 INFO L226 Difference]: Without dead ends: 87 [2019-09-20 12:59:36,051 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-20 12:59:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-09-20 12:59:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 12:59:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-09-20 12:59:36,068 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 56 [2019-09-20 12:59:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:36,068 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-09-20 12:59:36,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:59:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-09-20 12:59:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 12:59:36,078 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:36,079 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:36,079 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1043072633, now seen corresponding path program 3 times [2019-09-20 12:59:36,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:36,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:36,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:37,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:37,447 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:37,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:37,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 12:59:37,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:37,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-20 12:59:37,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:38,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:38,808 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 17 treesize of output 18 [2019-09-20 12:59:38,809 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-20 12:59:38,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:38,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:38,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 12:59:38,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:31 [2019-09-20 12:59:38,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:38,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:38,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:39,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:39,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 35 [2019-09-20 12:59:39,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-20 12:59:39,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-20 12:59:39,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2019-09-20 12:59:39,096 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 35 states. [2019-09-20 12:59:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:41,434 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2019-09-20 12:59:41,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-20 12:59:41,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 76 [2019-09-20 12:59:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:41,437 INFO L225 Difference]: With dead ends: 212 [2019-09-20 12:59:41,437 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 12:59:41,439 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 40 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2019-09-20 12:59:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 12:59:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 130. [2019-09-20 12:59:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-20 12:59:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-09-20 12:59:41,469 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 76 [2019-09-20 12:59:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:41,470 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-09-20 12:59:41,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-20 12:59:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2019-09-20 12:59:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 12:59:41,472 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:41,472 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:41,472 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash 867658167, now seen corresponding path program 4 times [2019-09-20 12:59:41,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:41,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:41,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:41,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-20 12:59:41,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:41,582 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:41,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:59:41,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:41,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:41,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:59:41,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-20 12:59:41,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:41,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-20 12:59:41,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:59:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:59:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:41,748 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand 13 states. [2019-09-20 12:59:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:42,079 INFO L93 Difference]: Finished difference Result 254 states and 292 transitions. [2019-09-20 12:59:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:42,079 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2019-09-20 12:59:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:42,081 INFO L225 Difference]: With dead ends: 254 [2019-09-20 12:59:42,081 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 12:59:42,083 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 12:59:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-20 12:59:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-20 12:59:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2019-09-20 12:59:42,099 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 78 [2019-09-20 12:59:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:42,100 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2019-09-20 12:59:42,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:59:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2019-09-20 12:59:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 12:59:42,101 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:42,102 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:42,102 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 277428085, now seen corresponding path program 5 times [2019-09-20 12:59:42,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:42,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:42,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:42,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:42,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-20 12:59:42,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:42,189 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:42,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 12:59:42,501 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-20 12:59:42,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:42,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:59:42,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-20 12:59:42,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:42,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-20 12:59:42,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:59:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:59:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:42,601 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 13 states. [2019-09-20 12:59:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:42,995 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2019-09-20 12:59:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:42,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-09-20 12:59:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:42,998 INFO L225 Difference]: With dead ends: 215 [2019-09-20 12:59:42,998 INFO L226 Difference]: Without dead ends: 109 [2019-09-20 12:59:43,000 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:59:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-20 12:59:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-09-20 12:59:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-20 12:59:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-09-20 12:59:43,008 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 80 [2019-09-20 12:59:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:43,008 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-09-20 12:59:43,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:59:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-09-20 12:59:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 12:59:43,010 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:43,010 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:43,010 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1937623581, now seen corresponding path program 6 times [2019-09-20 12:59:43,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:43,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:43,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:43,973 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 11 [2019-09-20 12:59:44,101 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 14 [2019-09-20 12:59:44,250 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 23 [2019-09-20 12:59:44,439 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 34 [2019-09-20 12:59:44,622 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 30 [2019-09-20 12:59:44,823 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2019-09-20 12:59:45,006 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2019-09-20 12:59:45,200 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 32 [2019-09-20 12:59:45,385 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 26 [2019-09-20 12:59:45,566 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 28 [2019-09-20 12:59:45,777 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 32 [2019-09-20 12:59:45,967 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 33 [2019-09-20 12:59:46,152 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 30 [2019-09-20 12:59:46,318 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 24 [2019-09-20 12:59:46,467 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 18 [2019-09-20 12:59:46,613 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 18 [2019-09-20 12:59:47,050 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 30 [2019-09-20 12:59:47,261 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2019-09-20 12:59:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:49,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:49,659 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:49,683 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 12:59:49,750 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-20 12:59:49,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:49,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-20 12:59:49,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:49,823 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-20 12:59:49,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:49,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:49,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:49,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-20 12:59:49,875 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-20 12:59:49,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:49,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:49,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:49,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-20 13:00:02,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:02,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,161 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:02,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:02,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:02,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:02,305 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-20 13:00:02,305 INFO L341 Elim1Store]: treesize reduction 6, result has 95.4 percent of original size [2019-09-20 13:00:02,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 60 treesize of output 137 [2019-09-20 13:00:02,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,438 INFO L496 ElimStorePlain]: Start of recursive call 2: 33 dim-0 vars, End of recursive call: 34 dim-0 vars, and 3 xjuncts. [2019-09-20 13:00:02,566 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 30 [2019-09-20 13:00:02,567 INFO L567 ElimStorePlain]: treesize reduction 960, result has 4.5 percent of original size [2019-09-20 13:00:02,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:00:02,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:88, output treesize:35 [2019-09-20 13:00:02,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:02,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:03,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:03,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 55] total 91 [2019-09-20 13:00:03,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-20 13:00:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-20 13:00:03,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=7393, Unknown=0, NotChecked=0, Total=8190 [2019-09-20 13:00:03,152 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 91 states. [2019-09-20 13:00:08,757 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 71