/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:05:08,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:05:08,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:05:08,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:05:08,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:05:08,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:05:08,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:05:08,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:05:08,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:05:08,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:05:08,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:05:08,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:05:08,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:05:08,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:05:08,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:05:08,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:05:08,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:05:08,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:05:08,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:05:08,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:05:08,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:05:08,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:05:08,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:05:08,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:05:08,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:05:08,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:05:08,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:05:08,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:05:08,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:05:08,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:05:08,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:05:08,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:05:08,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:05:08,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:05:08,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:05:08,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:05:08,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:05:08,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:05:08,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:05:08,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:05:08,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:05:08,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:05:08,467 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:05:08,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:05:08,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:05:08,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:05:08,473 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:05:08,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:05:08,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:05:08,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:05:08,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:05:08,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:05:08,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:05:08,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:05:08,476 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:05:08,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:05:08,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:05:08,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:05:08,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:05:08,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:05:08,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:05:08,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:05:08,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:05:08,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:05:08,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:05:08,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:05:08,479 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:05:08,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:05:08,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:05:08,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:05:08,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:05:08,928 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:05:08,930 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:05:08,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2020-12-22 07:05:09,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bb5d124/d0570037ccc740b99db85204fc0b0ecd/FLAG424f990e9 [2020-12-22 07:05:09,747 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:05:09,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2020-12-22 07:05:09,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bb5d124/d0570037ccc740b99db85204fc0b0ecd/FLAG424f990e9 [2020-12-22 07:05:10,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bb5d124/d0570037ccc740b99db85204fc0b0ecd [2020-12-22 07:05:10,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:05:10,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:05:10,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:05:10,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:05:10,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:05:10,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211971dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10, skipping insertion in model container [2020-12-22 07:05:10,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:05:10,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:05:10,249 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2020-12-22 07:05:10,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:05:10,316 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:05:10,330 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2020-12-22 07:05:10,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:05:10,396 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:05:10,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10 WrapperNode [2020-12-22 07:05:10,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:05:10,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:05:10,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:05:10,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:05:10,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:05:10,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:05:10,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:05:10,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:05:10,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (1/1) ... [2020-12-22 07:05:10,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:05:10,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:05:10,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:05:10,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:05:10,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (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 [2020-12-22 07:05:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:05:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:05:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:05:10,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:05:11,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:05:11,286 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2020-12-22 07:05:11,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:11 BoogieIcfgContainer [2020-12-22 07:05:11,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:05:11,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:05:11,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:05:11,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:05:11,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:05:10" (1/3) ... [2020-12-22 07:05:11,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4722e345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:05:11, skipping insertion in model container [2020-12-22 07:05:11,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:10" (2/3) ... [2020-12-22 07:05:11,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4722e345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:05:11, skipping insertion in model container [2020-12-22 07:05:11,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:11" (3/3) ... [2020-12-22 07:05:11,310 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2020-12-22 07:05:11,319 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:05:11,327 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 07:05:11,355 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-22 07:05:11,410 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:05:11,411 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:05:11,411 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:05:11,411 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:05:11,411 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:05:11,411 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:05:11,411 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:05:11,411 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:05:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2020-12-22 07:05:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 07:05:11,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:11,457 INFO L422 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] [2020-12-22 07:05:11,457 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2020-12-22 07:05:11,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:11,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554862118] [2020-12-22 07:05:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:11,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554862118] [2020-12-22 07:05:11,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:11,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:11,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490568623] [2020-12-22 07:05:11,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:11,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:11,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:11,833 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2020-12-22 07:05:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:11,945 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2020-12-22 07:05:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:11,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-22 07:05:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:11,984 INFO L225 Difference]: With dead ends: 210 [2020-12-22 07:05:11,984 INFO L226 Difference]: Without dead ends: 104 [2020-12-22 07:05:11,992 INFO L677 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 [2020-12-22 07:05:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-22 07:05:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-22 07:05:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-22 07:05:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2020-12-22 07:05:12,072 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2020-12-22 07:05:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:12,072 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2020-12-22 07:05:12,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2020-12-22 07:05:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-22 07:05:12,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:12,079 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:12,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:05:12,080 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2020-12-22 07:05:12,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:12,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025451201] [2020-12-22 07:05:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:12,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025451201] [2020-12-22 07:05:12,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:12,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:12,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004473119] [2020-12-22 07:05:12,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:12,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:12,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:12,258 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2020-12-22 07:05:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:12,287 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2020-12-22 07:05:12,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:12,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-22 07:05:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:12,289 INFO L225 Difference]: With dead ends: 199 [2020-12-22 07:05:12,289 INFO L226 Difference]: Without dead ends: 104 [2020-12-22 07:05:12,291 INFO L677 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 [2020-12-22 07:05:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-22 07:05:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-22 07:05:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-22 07:05:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2020-12-22 07:05:12,303 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2020-12-22 07:05:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:12,303 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2020-12-22 07:05:12,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2020-12-22 07:05:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-22 07:05:12,306 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:12,306 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:12,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:05:12,307 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2020-12-22 07:05:12,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:12,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065907670] [2020-12-22 07:05:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:12,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065907670] [2020-12-22 07:05:12,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:12,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:12,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660975340] [2020-12-22 07:05:12,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:12,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:12,378 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2020-12-22 07:05:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:12,407 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2020-12-22 07:05:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:12,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-22 07:05:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:12,409 INFO L225 Difference]: With dead ends: 196 [2020-12-22 07:05:12,410 INFO L226 Difference]: Without dead ends: 104 [2020-12-22 07:05:12,411 INFO L677 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 [2020-12-22 07:05:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-22 07:05:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-22 07:05:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-22 07:05:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2020-12-22 07:05:12,422 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2020-12-22 07:05:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:12,422 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2020-12-22 07:05:12,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2020-12-22 07:05:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-22 07:05:12,425 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:12,425 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:12,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:05:12,426 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:12,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2020-12-22 07:05:12,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:12,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511744691] [2020-12-22 07:05:12,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:12,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511744691] [2020-12-22 07:05:12,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:12,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:12,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335539484] [2020-12-22 07:05:12,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:12,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:12,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:12,519 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2020-12-22 07:05:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:12,550 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2020-12-22 07:05:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:12,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-22 07:05:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:12,558 INFO L225 Difference]: With dead ends: 193 [2020-12-22 07:05:12,559 INFO L226 Difference]: Without dead ends: 104 [2020-12-22 07:05:12,559 INFO L677 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 [2020-12-22 07:05:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-22 07:05:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-22 07:05:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-22 07:05:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2020-12-22 07:05:12,576 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2020-12-22 07:05:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:12,576 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2020-12-22 07:05:12,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2020-12-22 07:05:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-22 07:05:12,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:12,579 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:12,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:05:12,580 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2020-12-22 07:05:12,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:12,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134597480] [2020-12-22 07:05:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:12,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134597480] [2020-12-22 07:05:12,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:12,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:12,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024429569] [2020-12-22 07:05:12,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:12,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:12,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:12,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:12,650 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2020-12-22 07:05:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:12,687 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2020-12-22 07:05:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:12,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-22 07:05:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:12,689 INFO L225 Difference]: With dead ends: 271 [2020-12-22 07:05:12,689 INFO L226 Difference]: Without dead ends: 191 [2020-12-22 07:05:12,690 INFO L677 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 [2020-12-22 07:05:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-22 07:05:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2020-12-22 07:05:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-22 07:05:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2020-12-22 07:05:12,708 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2020-12-22 07:05:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:12,708 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2020-12-22 07:05:12,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2020-12-22 07:05:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-22 07:05:12,711 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:12,712 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:12,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:05:12,712 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:12,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2020-12-22 07:05:12,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:12,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030664248] [2020-12-22 07:05:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:12,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030664248] [2020-12-22 07:05:12,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:12,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:05:12,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800512358] [2020-12-22 07:05:12,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:05:12,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:05:12,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:12,812 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 6 states. [2020-12-22 07:05:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:12,912 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2020-12-22 07:05:12,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 07:05:12,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-12-22 07:05:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:12,914 INFO L225 Difference]: With dead ends: 444 [2020-12-22 07:05:12,914 INFO L226 Difference]: Without dead ends: 261 [2020-12-22 07:05:12,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-22 07:05:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-22 07:05:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2020-12-22 07:05:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-22 07:05:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2020-12-22 07:05:12,933 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2020-12-22 07:05:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:12,934 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2020-12-22 07:05:12,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:05:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2020-12-22 07:05:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-22 07:05:12,936 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:12,936 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:12,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:05:12,937 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:12,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:12,937 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2020-12-22 07:05:12,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:12,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120878495] [2020-12-22 07:05:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:12,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120878495] [2020-12-22 07:05:12,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:12,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:12,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868685901] [2020-12-22 07:05:12,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:12,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:12,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:12,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:12,993 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand 3 states. [2020-12-22 07:05:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:13,030 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2020-12-22 07:05:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:13,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-22 07:05:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:13,033 INFO L225 Difference]: With dead ends: 408 [2020-12-22 07:05:13,033 INFO L226 Difference]: Without dead ends: 271 [2020-12-22 07:05:13,034 INFO L677 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 [2020-12-22 07:05:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-22 07:05:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2020-12-22 07:05:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-12-22 07:05:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2020-12-22 07:05:13,067 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2020-12-22 07:05:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:13,068 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2020-12-22 07:05:13,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2020-12-22 07:05:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-22 07:05:13,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:13,069 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:13,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:05:13,070 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2020-12-22 07:05:13,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:13,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552772448] [2020-12-22 07:05:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:13,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552772448] [2020-12-22 07:05:13,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:13,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:13,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644637227] [2020-12-22 07:05:13,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:13,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:13,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:13,204 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand 5 states. [2020-12-22 07:05:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:13,290 INFO L93 Difference]: Finished difference Result 622 states and 975 transitions. [2020-12-22 07:05:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:13,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-22 07:05:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:13,295 INFO L225 Difference]: With dead ends: 622 [2020-12-22 07:05:13,295 INFO L226 Difference]: Without dead ends: 427 [2020-12-22 07:05:13,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-12-22 07:05:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 280. [2020-12-22 07:05:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-12-22 07:05:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2020-12-22 07:05:13,318 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2020-12-22 07:05:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:13,318 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2020-12-22 07:05:13,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2020-12-22 07:05:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-22 07:05:13,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:13,320 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:13,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:05:13,321 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2020-12-22 07:05:13,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:13,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787407147] [2020-12-22 07:05:13,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:13,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787407147] [2020-12-22 07:05:13,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:13,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:13,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397926480] [2020-12-22 07:05:13,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:13,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:13,362 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand 3 states. [2020-12-22 07:05:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:13,402 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2020-12-22 07:05:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:13,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-22 07:05:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:13,405 INFO L225 Difference]: With dead ends: 563 [2020-12-22 07:05:13,406 INFO L226 Difference]: Without dead ends: 332 [2020-12-22 07:05:13,412 INFO L677 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 [2020-12-22 07:05:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-12-22 07:05:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2020-12-22 07:05:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-12-22 07:05:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2020-12-22 07:05:13,430 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2020-12-22 07:05:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:13,431 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2020-12-22 07:05:13,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2020-12-22 07:05:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-22 07:05:13,432 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:13,433 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:13,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:05:13,433 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:13,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:13,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2020-12-22 07:05:13,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:13,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421086891] [2020-12-22 07:05:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:13,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421086891] [2020-12-22 07:05:13,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:13,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:13,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101590119] [2020-12-22 07:05:13,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:13,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:13,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:13,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:13,474 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand 3 states. [2020-12-22 07:05:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:13,510 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2020-12-22 07:05:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:13,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-22 07:05:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:13,512 INFO L225 Difference]: With dead ends: 567 [2020-12-22 07:05:13,513 INFO L226 Difference]: Without dead ends: 284 [2020-12-22 07:05:13,514 INFO L677 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 [2020-12-22 07:05:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-22 07:05:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-12-22 07:05:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-22 07:05:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2020-12-22 07:05:13,529 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2020-12-22 07:05:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:13,529 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2020-12-22 07:05:13,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2020-12-22 07:05:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-22 07:05:13,531 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:13,531 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:13,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:05:13,531 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2020-12-22 07:05:13,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:13,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700847308] [2020-12-22 07:05:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:13,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700847308] [2020-12-22 07:05:13,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:13,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:13,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906594308] [2020-12-22 07:05:13,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:13,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:13,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:13,594 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2020-12-22 07:05:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:13,652 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2020-12-22 07:05:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:13,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-12-22 07:05:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:13,656 INFO L225 Difference]: With dead ends: 811 [2020-12-22 07:05:13,656 INFO L226 Difference]: Without dead ends: 580 [2020-12-22 07:05:13,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-12-22 07:05:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2020-12-22 07:05:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-12-22 07:05:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2020-12-22 07:05:13,688 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2020-12-22 07:05:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:13,688 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2020-12-22 07:05:13,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2020-12-22 07:05:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-22 07:05:13,690 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:13,690 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:13,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:05:13,691 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2020-12-22 07:05:13,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:13,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86361225] [2020-12-22 07:05:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:13,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86361225] [2020-12-22 07:05:13,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:13,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:13,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340563234] [2020-12-22 07:05:13,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:13,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:13,755 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand 5 states. [2020-12-22 07:05:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:13,830 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2020-12-22 07:05:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:05:13,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-12-22 07:05:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:13,834 INFO L225 Difference]: With dead ends: 1097 [2020-12-22 07:05:13,834 INFO L226 Difference]: Without dead ends: 574 [2020-12-22 07:05:13,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-22 07:05:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2020-12-22 07:05:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-12-22 07:05:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2020-12-22 07:05:13,875 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2020-12-22 07:05:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:13,876 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2020-12-22 07:05:13,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2020-12-22 07:05:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-22 07:05:13,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:13,878 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:13,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:05:13,878 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2020-12-22 07:05:13,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:13,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812532293] [2020-12-22 07:05:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:13,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812532293] [2020-12-22 07:05:13,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:13,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:13,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242114152] [2020-12-22 07:05:13,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:13,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:13,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:13,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:13,920 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand 3 states. [2020-12-22 07:05:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:13,997 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2020-12-22 07:05:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:13,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-12-22 07:05:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:14,003 INFO L225 Difference]: With dead ends: 1592 [2020-12-22 07:05:14,004 INFO L226 Difference]: Without dead ends: 1069 [2020-12-22 07:05:14,005 INFO L677 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 [2020-12-22 07:05:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2020-12-22 07:05:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2020-12-22 07:05:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-12-22 07:05:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2020-12-22 07:05:14,071 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2020-12-22 07:05:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:14,073 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2020-12-22 07:05:14,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2020-12-22 07:05:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-22 07:05:14,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:14,079 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:14,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:05:14,079 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2020-12-22 07:05:14,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:14,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713736197] [2020-12-22 07:05:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:14,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713736197] [2020-12-22 07:05:14,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:14,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:14,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651628881] [2020-12-22 07:05:14,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:14,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:14,180 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand 5 states. [2020-12-22 07:05:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:14,256 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2020-12-22 07:05:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:05:14,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-12-22 07:05:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:14,262 INFO L225 Difference]: With dead ends: 1105 [2020-12-22 07:05:14,262 INFO L226 Difference]: Without dead ends: 570 [2020-12-22 07:05:14,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-12-22 07:05:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-12-22 07:05:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-12-22 07:05:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2020-12-22 07:05:14,320 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2020-12-22 07:05:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:14,321 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2020-12-22 07:05:14,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2020-12-22 07:05:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-22 07:05:14,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:14,324 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:14,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:05:14,324 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2020-12-22 07:05:14,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:14,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662527063] [2020-12-22 07:05:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:14,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662527063] [2020-12-22 07:05:14,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:14,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:14,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656131260] [2020-12-22 07:05:14,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:14,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:14,378 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand 3 states. [2020-12-22 07:05:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:14,498 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2020-12-22 07:05:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:14,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-22 07:05:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:14,506 INFO L225 Difference]: With dead ends: 1592 [2020-12-22 07:05:14,506 INFO L226 Difference]: Without dead ends: 1073 [2020-12-22 07:05:14,508 INFO L677 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 [2020-12-22 07:05:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2020-12-22 07:05:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2020-12-22 07:05:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-12-22 07:05:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2020-12-22 07:05:14,580 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2020-12-22 07:05:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:14,580 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2020-12-22 07:05:14,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2020-12-22 07:05:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-22 07:05:14,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:14,584 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:14,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:05:14,584 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2020-12-22 07:05:14,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:14,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263427918] [2020-12-22 07:05:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:14,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263427918] [2020-12-22 07:05:14,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:14,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:14,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063140920] [2020-12-22 07:05:14,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:14,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:14,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:14,635 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand 3 states. [2020-12-22 07:05:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:14,719 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2020-12-22 07:05:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:14,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-22 07:05:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:14,724 INFO L225 Difference]: With dead ends: 1311 [2020-12-22 07:05:14,724 INFO L226 Difference]: Without dead ends: 784 [2020-12-22 07:05:14,726 INFO L677 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 [2020-12-22 07:05:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-12-22 07:05:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2020-12-22 07:05:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-12-22 07:05:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2020-12-22 07:05:14,791 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2020-12-22 07:05:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:14,791 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2020-12-22 07:05:14,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2020-12-22 07:05:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-22 07:05:14,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:14,793 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:14,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:05:14,794 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2020-12-22 07:05:14,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:14,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396173505] [2020-12-22 07:05:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:14,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396173505] [2020-12-22 07:05:14,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675906525] [2020-12-22 07:05:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:14,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-22 07:05:14,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:15,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:15,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-22 07:05:15,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715051521] [2020-12-22 07:05:15,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:15,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:15,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:15,092 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand 3 states. [2020-12-22 07:05:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:15,180 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2020-12-22 07:05:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:15,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-22 07:05:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:15,185 INFO L225 Difference]: With dead ends: 1341 [2020-12-22 07:05:15,186 INFO L226 Difference]: Without dead ends: 686 [2020-12-22 07:05:15,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-12-22 07:05:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2020-12-22 07:05:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-12-22 07:05:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2020-12-22 07:05:15,254 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2020-12-22 07:05:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:15,254 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2020-12-22 07:05:15,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2020-12-22 07:05:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-22 07:05:15,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:15,256 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:15,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-22 07:05:15,471 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2020-12-22 07:05:15,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:15,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646738094] [2020-12-22 07:05:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:15,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646738094] [2020-12-22 07:05:15,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880527053] [2020-12-22 07:05:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:15,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-22 07:05:15,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:15,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:15,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-22 07:05:15,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510213411] [2020-12-22 07:05:15,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:15,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:15,737 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand 3 states. [2020-12-22 07:05:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:15,880 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2020-12-22 07:05:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:15,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-22 07:05:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:15,888 INFO L225 Difference]: With dead ends: 2025 [2020-12-22 07:05:15,888 INFO L226 Difference]: Without dead ends: 1364 [2020-12-22 07:05:15,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-12-22 07:05:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2020-12-22 07:05:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2020-12-22 07:05:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2020-12-22 07:05:16,026 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2020-12-22 07:05:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:16,026 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2020-12-22 07:05:16,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2020-12-22 07:05:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-22 07:05:16,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:16,029 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:16,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-22 07:05:16,243 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2020-12-22 07:05:16,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:16,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991039904] [2020-12-22 07:05:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:16,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991039904] [2020-12-22 07:05:16,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:16,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:16,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940526415] [2020-12-22 07:05:16,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:16,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:16,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:16,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:16,285 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand 3 states. [2020-12-22 07:05:16,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:16,430 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2020-12-22 07:05:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:16,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-22 07:05:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:16,438 INFO L225 Difference]: With dead ends: 2736 [2020-12-22 07:05:16,438 INFO L226 Difference]: Without dead ends: 1463 [2020-12-22 07:05:16,442 INFO L677 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 [2020-12-22 07:05:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-12-22 07:05:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2020-12-22 07:05:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2020-12-22 07:05:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2020-12-22 07:05:16,575 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2020-12-22 07:05:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:16,575 INFO L481 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2020-12-22 07:05:16,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2020-12-22 07:05:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-22 07:05:16,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:16,578 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:16,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:05:16,579 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:16,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2020-12-22 07:05:16,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:16,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768301013] [2020-12-22 07:05:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:16,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768301013] [2020-12-22 07:05:16,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:16,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:16,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631658877] [2020-12-22 07:05:16,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:16,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:16,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:16,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:16,650 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand 3 states. [2020-12-22 07:05:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:16,767 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2020-12-22 07:05:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:16,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-22 07:05:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:16,773 INFO L225 Difference]: With dead ends: 2354 [2020-12-22 07:05:16,773 INFO L226 Difference]: Without dead ends: 973 [2020-12-22 07:05:16,776 INFO L677 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 [2020-12-22 07:05:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-12-22 07:05:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2020-12-22 07:05:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2020-12-22 07:05:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2020-12-22 07:05:16,856 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2020-12-22 07:05:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:16,857 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2020-12-22 07:05:16,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2020-12-22 07:05:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-22 07:05:16,859 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:16,859 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:16,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:05:16,859 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2020-12-22 07:05:16,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:16,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424441645] [2020-12-22 07:05:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:16,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424441645] [2020-12-22 07:05:16,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:16,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:16,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081713023] [2020-12-22 07:05:16,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:16,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:16,924 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand 4 states. [2020-12-22 07:05:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:16,975 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2020-12-22 07:05:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:16,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-22 07:05:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:16,978 INFO L225 Difference]: With dead ends: 1258 [2020-12-22 07:05:16,978 INFO L226 Difference]: Without dead ends: 373 [2020-12-22 07:05:16,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-12-22 07:05:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-12-22 07:05:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-22 07:05:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2020-12-22 07:05:17,014 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2020-12-22 07:05:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:17,015 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2020-12-22 07:05:17,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2020-12-22 07:05:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-22 07:05:17,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:17,016 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:17,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:05:17,017 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2020-12-22 07:05:17,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:17,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582790147] [2020-12-22 07:05:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:17,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582790147] [2020-12-22 07:05:17,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778508886] [2020-12-22 07:05:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:17,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-22 07:05:17,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:17,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:17,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-22 07:05:17,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830192782] [2020-12-22 07:05:17,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:17,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:17,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:17,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:17,321 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand 3 states. [2020-12-22 07:05:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:17,414 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2020-12-22 07:05:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:17,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-22 07:05:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:17,419 INFO L225 Difference]: With dead ends: 1059 [2020-12-22 07:05:17,419 INFO L226 Difference]: Without dead ends: 732 [2020-12-22 07:05:17,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-12-22 07:05:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2020-12-22 07:05:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2020-12-22 07:05:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2020-12-22 07:05:17,484 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2020-12-22 07:05:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:17,484 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2020-12-22 07:05:17,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2020-12-22 07:05:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-22 07:05:17,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:17,486 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:17,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-22 07:05:17,699 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2020-12-22 07:05:17,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:17,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934763030] [2020-12-22 07:05:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:17,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934763030] [2020-12-22 07:05:17,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:17,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:17,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291563917] [2020-12-22 07:05:17,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:17,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:17,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:17,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:17,761 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand 3 states. [2020-12-22 07:05:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:17,864 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2020-12-22 07:05:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:17,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-22 07:05:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:17,869 INFO L225 Difference]: With dead ends: 1382 [2020-12-22 07:05:17,870 INFO L226 Difference]: Without dead ends: 811 [2020-12-22 07:05:17,871 INFO L677 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 [2020-12-22 07:05:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-12-22 07:05:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2020-12-22 07:05:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2020-12-22 07:05:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2020-12-22 07:05:17,953 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2020-12-22 07:05:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:17,953 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2020-12-22 07:05:17,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2020-12-22 07:05:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-22 07:05:17,956 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:17,956 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-12-22 07:05:17,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 07:05:17,956 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2020-12-22 07:05:17,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:17,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405140530] [2020-12-22 07:05:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:17,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405140530] [2020-12-22 07:05:17,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:17,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:17,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634272358] [2020-12-22 07:05:17,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:17,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:17,995 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand 3 states. [2020-12-22 07:05:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:18,054 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2020-12-22 07:05:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:18,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-22 07:05:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:18,058 INFO L225 Difference]: With dead ends: 1208 [2020-12-22 07:05:18,058 INFO L226 Difference]: Without dead ends: 551 [2020-12-22 07:05:18,059 INFO L677 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 [2020-12-22 07:05:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-12-22 07:05:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2020-12-22 07:05:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-12-22 07:05:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2020-12-22 07:05:18,101 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2020-12-22 07:05:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:18,101 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2020-12-22 07:05:18,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2020-12-22 07:05:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:05:18,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:18,104 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1] [2020-12-22 07:05:18,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 07:05:18,104 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2020-12-22 07:05:18,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:18,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639300624] [2020-12-22 07:05:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:18,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639300624] [2020-12-22 07:05:18,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:18,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:18,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731204476] [2020-12-22 07:05:18,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:18,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:18,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:18,162 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand 4 states. [2020-12-22 07:05:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:18,209 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2020-12-22 07:05:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:18,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-22 07:05:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:18,212 INFO L225 Difference]: With dead ends: 820 [2020-12-22 07:05:18,212 INFO L226 Difference]: Without dead ends: 427 [2020-12-22 07:05:18,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-12-22 07:05:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-12-22 07:05:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-12-22 07:05:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2020-12-22 07:05:18,247 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2020-12-22 07:05:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:18,247 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2020-12-22 07:05:18,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2020-12-22 07:05:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:05:18,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:18,249 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1] [2020-12-22 07:05:18,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 07:05:18,249 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2020-12-22 07:05:18,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:18,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831289154] [2020-12-22 07:05:18,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:18,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831289154] [2020-12-22 07:05:18,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029550513] [2020-12-22 07:05:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:18,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-22 07:05:18,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 07:05:18,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:18,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-22 07:05:18,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886384254] [2020-12-22 07:05:18,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:18,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:18,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:18,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:18,492 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand 3 states. [2020-12-22 07:05:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:18,586 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2020-12-22 07:05:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:18,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-22 07:05:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:18,591 INFO L225 Difference]: With dead ends: 1163 [2020-12-22 07:05:18,591 INFO L226 Difference]: Without dead ends: 822 [2020-12-22 07:05:18,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-12-22 07:05:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2020-12-22 07:05:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-12-22 07:05:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2020-12-22 07:05:18,661 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2020-12-22 07:05:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:18,661 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2020-12-22 07:05:18,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2020-12-22 07:05:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:05:18,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:18,664 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1] [2020-12-22 07:05:18,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:18,877 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2020-12-22 07:05:18,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:18,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039529256] [2020-12-22 07:05:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:18,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039529256] [2020-12-22 07:05:18,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389323877] [2020-12-22 07:05:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:19,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-22 07:05:19,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:19,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:19,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-12-22 07:05:19,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712907231] [2020-12-22 07:05:19,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:19,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:19,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:19,143 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand 4 states. [2020-12-22 07:05:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:19,250 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2020-12-22 07:05:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:19,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-22 07:05:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:19,256 INFO L225 Difference]: With dead ends: 1704 [2020-12-22 07:05:19,257 INFO L226 Difference]: Without dead ends: 1054 [2020-12-22 07:05:19,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2020-12-22 07:05:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2020-12-22 07:05:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2020-12-22 07:05:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2020-12-22 07:05:19,353 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2020-12-22 07:05:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:19,354 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2020-12-22 07:05:19,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2020-12-22 07:05:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:05:19,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:19,356 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1] [2020-12-22 07:05:19,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-22 07:05:19,569 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2020-12-22 07:05:19,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:19,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620502293] [2020-12-22 07:05:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:19,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620502293] [2020-12-22 07:05:19,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:19,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:19,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207891522] [2020-12-22 07:05:19,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:19,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:19,640 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand 4 states. [2020-12-22 07:05:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:19,824 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2020-12-22 07:05:19,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:19,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-22 07:05:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:19,833 INFO L225 Difference]: With dead ends: 2540 [2020-12-22 07:05:19,834 INFO L226 Difference]: Without dead ends: 1698 [2020-12-22 07:05:19,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2020-12-22 07:05:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2020-12-22 07:05:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2020-12-22 07:05:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2020-12-22 07:05:19,941 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2020-12-22 07:05:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:19,941 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2020-12-22 07:05:19,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2020-12-22 07:05:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:05:19,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:19,944 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1] [2020-12-22 07:05:19,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 07:05:19,944 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2020-12-22 07:05:19,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:19,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811266804] [2020-12-22 07:05:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:19,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811266804] [2020-12-22 07:05:19,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:19,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:19,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002203604] [2020-12-22 07:05:19,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:19,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:20,000 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand 5 states. [2020-12-22 07:05:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:20,077 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2020-12-22 07:05:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:05:20,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-12-22 07:05:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:20,078 INFO L225 Difference]: With dead ends: 1285 [2020-12-22 07:05:20,078 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 07:05:20,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 07:05:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 07:05:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 07:05:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 07:05:20,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2020-12-22 07:05:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:20,081 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 07:05:20,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 07:05:20,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 07:05:20,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 07:05:20,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 07:05:21,419 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-12-22 07:05:21,604 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-12-22 07:05:21,796 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-22 07:05:21,955 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-12-22 07:05:22,111 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-22 07:05:22,282 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-22 07:05:22,423 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-22 07:05:22,684 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2020-12-22 07:05:22,819 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-22 07:05:23,055 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-12-22 07:05:23,184 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-12-22 07:05:23,369 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-22 07:05:23,481 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-12-22 07:05:23,823 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-12-22 07:05:24,065 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-12-22 07:05:24,193 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-12-22 07:05:24,422 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-12-22 07:05:24,692 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2020-12-22 07:05:24,824 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-12-22 07:05:24,987 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-22 07:05:25,164 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-12-22 07:05:25,337 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-22 07:05:25,526 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-12-22 07:05:25,532 INFO L189 CegarLoopUtils]: For program point L399(lines 399 404) no Hoare annotation was computed. [2020-12-22 07:05:25,534 INFO L185 CegarLoopUtils]: At program point L333-1(lines 309 341) the Hoare annotation is: (let ((.cse6 (<= 2 ~b1_ev~0)) (.cse0 (= ~d0_ev~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse16 (= ~b1_ev~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse15 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14))) [2020-12-22 07:05:25,535 INFO L185 CegarLoopUtils]: At program point L267(lines 259 269) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2020-12-22 07:05:25,535 INFO L185 CegarLoopUtils]: At program point L366-3(lines 342 374) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,535 INFO L185 CegarLoopUtils]: At program point L333-3(lines 309 341) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,536 INFO L185 CegarLoopUtils]: At program point L267-1(lines 259 269) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,536 INFO L185 CegarLoopUtils]: At program point L268(lines 256 270) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2020-12-22 07:05:25,536 INFO L185 CegarLoopUtils]: At program point L268-1(lines 256 270) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,537 INFO L189 CegarLoopUtils]: For program point L103(lines 103 118) no Hoare annotation was computed. [2020-12-22 07:05:25,538 INFO L189 CegarLoopUtils]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2020-12-22 07:05:25,538 INFO L189 CegarLoopUtils]: For program point L71(lines 43 93) no Hoare annotation was computed. [2020-12-22 07:05:25,538 INFO L192 CegarLoopUtils]: At program point L501(lines 485 503) the Hoare annotation is: true [2020-12-22 07:05:25,538 INFO L185 CegarLoopUtils]: At program point L303(lines 271 308) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,539 INFO L189 CegarLoopUtils]: For program point L204(lines 204 210) no Hoare annotation was computed. [2020-12-22 07:05:25,539 INFO L185 CegarLoopUtils]: At program point L204-1(lines 203 241) the Hoare annotation is: (and (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0) (not (= ~d1_val_t~0 0)) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (<= 2 ~d1_ev~0)) [2020-12-22 07:05:25,539 INFO L189 CegarLoopUtils]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2020-12-22 07:05:25,539 INFO L185 CegarLoopUtils]: At program point L204-3(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,540 INFO L189 CegarLoopUtils]: For program point L72(lines 72 76) no Hoare annotation was computed. [2020-12-22 07:05:25,540 INFO L189 CegarLoopUtils]: For program point L107(lines 107 117) no Hoare annotation was computed. [2020-12-22 07:05:25,540 INFO L189 CegarLoopUtils]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2020-12-22 07:05:25,540 INFO L189 CegarLoopUtils]: For program point L174(lines 174 179) no Hoare annotation was computed. [2020-12-22 07:05:25,540 INFO L189 CegarLoopUtils]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2020-12-22 07:05:25,540 INFO L189 CegarLoopUtils]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2020-12-22 07:05:25,540 INFO L189 CegarLoopUtils]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2020-12-22 07:05:25,541 INFO L185 CegarLoopUtils]: At program point L406(lines 395 408) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,541 INFO L185 CegarLoopUtils]: At program point L407(lines 391 409) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,541 INFO L189 CegarLoopUtils]: For program point L44(lines 44 52) no Hoare annotation was computed. [2020-12-22 07:05:25,541 INFO L189 CegarLoopUtils]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2020-12-22 07:05:25,541 INFO L189 CegarLoopUtils]: For program point L11(line 11) no Hoare annotation was computed. [2020-12-22 07:05:25,541 INFO L189 CegarLoopUtils]: For program point L441(lines 441 445) no Hoare annotation was computed. [2020-12-22 07:05:25,541 INFO L189 CegarLoopUtils]: For program point L144(lines 144 149) no Hoare annotation was computed. [2020-12-22 07:05:25,541 INFO L189 CegarLoopUtils]: For program point L111(lines 111 116) no Hoare annotation was computed. [2020-12-22 07:05:25,542 INFO L189 CegarLoopUtils]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2020-12-22 07:05:25,542 INFO L189 CegarLoopUtils]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2020-12-22 07:05:25,542 INFO L189 CegarLoopUtils]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-12-22 07:05:25,542 INFO L189 CegarLoopUtils]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2020-12-22 07:05:25,542 INFO L189 CegarLoopUtils]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2020-12-22 07:05:25,542 INFO L185 CegarLoopUtils]: At program point L211(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d0_val_t~0 0))) (.cse1 (= ~z_ev~0 2)) (.cse2 (= ~z_val~0 0)) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (= ~d1_req_up~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= ~d0_req_up~0 1)) (.cse14 (= 0 ~z_val_t~0)) (.cse15 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~b1_ev~0 0) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b1_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-12-22 07:05:25,546 INFO L185 CegarLoopUtils]: At program point L211-1(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,546 INFO L189 CegarLoopUtils]: For program point L278(line 278) no Hoare annotation was computed. [2020-12-22 07:05:25,546 INFO L189 CegarLoopUtils]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,546 INFO L189 CegarLoopUtils]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,546 INFO L189 CegarLoopUtils]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2020-12-22 07:05:25,547 INFO L189 CegarLoopUtils]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,547 INFO L185 CegarLoopUtils]: At program point L247-1(lines 313 317) the Hoare annotation is: (let ((.cse7 (= ~d0_ev~0 0)) (.cse13 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (not (= ~b1_val~0 0))) (.cse15 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_req_up~0 1))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse9 (not (= 1 ~b1_req_up~0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse14))) [2020-12-22 07:05:25,547 INFO L189 CegarLoopUtils]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,547 INFO L189 CegarLoopUtils]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-12-22 07:05:25,548 INFO L189 CegarLoopUtils]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2020-12-22 07:05:25,548 INFO L185 CegarLoopUtils]: At program point L447(lines 493 499) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~b1_val_t~0 0)) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (not (= 1 ~b1_req_up~0)) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_req_up~0 1))) [2020-12-22 07:05:25,549 INFO L189 CegarLoopUtils]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-12-22 07:05:25,549 INFO L189 CegarLoopUtils]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2020-12-22 07:05:25,549 INFO L189 CegarLoopUtils]: For program point L382(lines 382 386) no Hoare annotation was computed. [2020-12-22 07:05:25,549 INFO L185 CegarLoopUtils]: At program point L382-2(lines 346 350) the Hoare annotation is: (let ((.cse11 (<= 2 ~d0_ev~0)) (.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2020-12-22 07:05:25,549 INFO L189 CegarLoopUtils]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2020-12-22 07:05:25,550 INFO L185 CegarLoopUtils]: At program point L382-5(lines 346 350) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,550 INFO L185 CegarLoopUtils]: At program point L482(lines 453 484) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~b1_ev~0) (= ~b0_val_t~0 1) (<= 2 ~d0_ev~0) (= ~b0_val~0 0) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~b0_req_up~0 1) (<= 2 ~d1_ev~0)) [2020-12-22 07:05:25,550 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 07:05:25,550 INFO L185 CegarLoopUtils]: At program point L218(lines 203 241) the Hoare annotation is: (let ((.cse9 (= ~d0_ev~0 0)) (.cse14 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (= ~d1_req_up~0 1)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse15 .cse16))) [2020-12-22 07:05:25,550 INFO L185 CegarLoopUtils]: At program point L218-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,551 INFO L189 CegarLoopUtils]: For program point L53(lines 43 93) no Hoare annotation was computed. [2020-12-22 07:05:25,551 INFO L189 CegarLoopUtils]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,551 INFO L189 CegarLoopUtils]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,551 INFO L189 CegarLoopUtils]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,551 INFO L189 CegarLoopUtils]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,551 INFO L189 CegarLoopUtils]: For program point L54(lines 54 58) no Hoare annotation was computed. [2020-12-22 07:05:25,552 INFO L185 CegarLoopUtils]: At program point L121(lines 98 123) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse11 (<= 2 ~d0_ev~0)) (.cse16 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2020-12-22 07:05:25,552 INFO L185 CegarLoopUtils]: At program point L121-1(lines 98 123) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,552 INFO L185 CegarLoopUtils]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,552 INFO L185 CegarLoopUtils]: At program point L122(lines 95 124) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse18 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (<= 2 ~d0_ev~0)) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (= |ULTIMATE.start_is_method1_triggered_#res| 1)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (not (= ~d1_val_t~0 0))) (.cse16 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2020-12-22 07:05:25,553 INFO L185 CegarLoopUtils]: At program point L122-1(lines 95 124) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_is_method1_triggered_#res| 1) .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,553 INFO L189 CegarLoopUtils]: For program point L189(lines 189 194) no Hoare annotation was computed. [2020-12-22 07:05:25,553 INFO L189 CegarLoopUtils]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2020-12-22 07:05:25,553 INFO L189 CegarLoopUtils]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2020-12-22 07:05:25,553 INFO L189 CegarLoopUtils]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2020-12-22 07:05:25,553 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 07:05:25,553 INFO L189 CegarLoopUtils]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,553 INFO L189 CegarLoopUtils]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,554 INFO L189 CegarLoopUtils]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,554 INFO L189 CegarLoopUtils]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,554 INFO L189 CegarLoopUtils]: For program point L291(lines 291 298) no Hoare annotation was computed. [2020-12-22 07:05:25,554 INFO L185 CegarLoopUtils]: At program point L225(lines 203 241) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-12-22 07:05:25,554 INFO L185 CegarLoopUtils]: At program point L225-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,554 INFO L189 CegarLoopUtils]: For program point L159(lines 159 164) no Hoare annotation was computed. [2020-12-22 07:05:25,555 INFO L189 CegarLoopUtils]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2020-12-22 07:05:25,555 INFO L189 CegarLoopUtils]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2020-12-22 07:05:25,555 INFO L189 CegarLoopUtils]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2020-12-22 07:05:25,555 INFO L185 CegarLoopUtils]: At program point L424-1(lines 342 446) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-22 07:05:25,555 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 07:05:25,555 INFO L189 CegarLoopUtils]: For program point L425(line 425) no Hoare annotation was computed. [2020-12-22 07:05:25,555 INFO L189 CegarLoopUtils]: For program point L260(lines 260 265) no Hoare annotation was computed. [2020-12-22 07:05:25,555 INFO L189 CegarLoopUtils]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L129(lines 129 134) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L192 CegarLoopUtils]: At program point L493(lines 493 499) the Hoare annotation is: true [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2020-12-22 07:05:25,556 INFO L189 CegarLoopUtils]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2020-12-22 07:05:25,557 INFO L189 CegarLoopUtils]: For program point L65(lines 65 69) no Hoare annotation was computed. [2020-12-22 07:05:25,557 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 07:05:25,557 INFO L189 CegarLoopUtils]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2020-12-22 07:05:25,557 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2020-12-22 07:05:25,557 INFO L189 CegarLoopUtils]: For program point L99(lines 99 119) no Hoare annotation was computed. [2020-12-22 07:05:25,557 INFO L189 CegarLoopUtils]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2020-12-22 07:05:25,557 INFO L185 CegarLoopUtils]: At program point L232(lines 247 251) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-12-22 07:05:25,558 INFO L185 CegarLoopUtils]: At program point L232-1(lines 200 242) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-22 07:05:25,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:05:25 BoogieIcfgContainer [2020-12-22 07:05:25,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:05:25,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:05:25,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:05:25,630 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:05:25,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:11" (3/4) ... [2020-12-22 07:05:25,637 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 07:05:25,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-22 07:05:25,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-22 07:05:25,662 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 07:05:25,663 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 07:05:25,704 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2020-12-22 07:05:25,706 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) [2020-12-22 07:05:25,708 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2020-12-22 07:05:25,810 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/bist_cell.cil.c-witness.graphml [2020-12-22 07:05:25,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:05:25,811 INFO L168 Benchmark]: Toolchain (without parser) took 15762.65 ms. Allocated memory was 151.0 MB in the beginning and 389.0 MB in the end (delta: 238.0 MB). Free memory was 126.5 MB in the beginning and 311.4 MB in the end (delta: -184.9 MB). Peak memory consumption was 53.8 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:25,812 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:05:25,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.94 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 113.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:25,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.92 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 110.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:25,813 INFO L168 Benchmark]: Boogie Preprocessor took 38.30 ms. Allocated memory is still 151.0 MB. Free memory was 110.9 MB in the beginning and 109.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:25,813 INFO L168 Benchmark]: RCFGBuilder took 775.07 ms. Allocated memory is still 151.0 MB. Free memory was 109.0 MB in the beginning and 106.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:25,814 INFO L168 Benchmark]: TraceAbstraction took 14336.12 ms. Allocated memory was 151.0 MB in the beginning and 389.0 MB in the end (delta: 238.0 MB). Free memory was 106.2 MB in the beginning and 321.3 MB in the end (delta: -215.1 MB). Peak memory consumption was 208.5 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:25,814 INFO L168 Benchmark]: Witness Printer took 179.87 ms. Allocated memory is still 389.0 MB. Free memory was 321.3 MB in the beginning and 311.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-22 07:05:25,818 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 347.94 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 113.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 74.92 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 110.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.30 ms. Allocated memory is still 151.0 MB. Free memory was 110.9 MB in the beginning and 109.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 775.07 ms. Allocated memory is still 151.0 MB. Free memory was 109.0 MB in the beginning and 106.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14336.12 ms. Allocated memory was 151.0 MB in the beginning and 389.0 MB in the end (delta: 238.0 MB). Free memory was 106.2 MB in the beginning and 321.3 MB in the end (delta: -215.1 MB). Peak memory consumption was 208.5 MB. Max. memory is 8.0 GB. * Witness Printer took 179.87 ms. Allocated memory is still 389.0 MB. Free memory was 321.3 MB in the beginning and 311.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && d1_val_t == b0_val_t) && 2 <= b1_ev) && b0_val_t == 1) && 2 <= d0_ev) && b0_val == 0) && 1 == b1_req_up) && b1_val_t == b0_val_t) && d0_req_up == 1) && 0 == z_val_t) && d0_val_t == b0_val_t) && b0_req_up == 1) && 2 <= d1_ev - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((2 <= b0_ev && !(b1_val_t == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && !(1 == b1_req_up)) && z_val == 0) && !(b1_val == 0)) && 0 == z_val_t) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && b0_ev == 0) && 1 == b1_req_up) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.6s, OverallIterations: 29, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4787 SDtfs, 2771 SDslu, 4972 SDs, 0 SdLazy, 398 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 2015 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3750 HoareAnnotationTreeSize, 33 FomulaSimplifications, 39368 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 14097 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 458837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...