./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/bist_cell.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:49:04,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:49:04,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:49:04,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:49:04,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:49:04,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:49:04,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:49:04,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:49:04,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:49:04,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:49:04,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:49:04,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:49:04,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:49:04,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:49:04,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:49:04,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:49:04,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:49:04,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:49:04,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:49:04,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:49:04,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:49:05,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:49:05,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:49:05,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:49:05,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:49:05,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:49:05,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:49:05,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:49:05,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:49:05,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:49:05,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:49:05,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:49:05,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:49:05,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:49:05,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:49:05,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:49:05,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:49:05,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:49:05,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:49:05,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:49:05,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:49:05,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:49:05,079 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:49:05,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:49:05,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:49:05,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:49:05,081 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:49:05,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:49:05,081 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:49:05,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:49:05,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:49:05,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:49:05,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:49:05,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:49:05,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:49:05,083 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:49:05,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:49:05,086 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:49:05,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:49:05,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:49:05,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:49:05,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:49:05,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:49:05,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:49:05,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:49:05,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:49:05,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:49:05,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:49:05,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:49:05,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:49:05,090 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:49:05,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 [2020-10-20 01:49:05,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:49:05,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:49:05,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:49:05,336 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:49:05,337 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:49:05,338 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-10-20 01:49:05,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4c60d00/5400a17377c14f77b12c6845426fc2f1/FLAG93ac4679e [2020-10-20 01:49:05,877 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:49:05,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2020-10-20 01:49:05,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4c60d00/5400a17377c14f77b12c6845426fc2f1/FLAG93ac4679e [2020-10-20 01:49:06,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4c60d00/5400a17377c14f77b12c6845426fc2f1 [2020-10-20 01:49:06,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:49:06,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:49:06,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:49:06,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:49:06,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:49:06,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1881fa13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06, skipping insertion in model container [2020-10-20 01:49:06,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:49:06,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:49:06,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:49:06,648 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:49:06,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:49:06,720 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:49:06,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06 WrapperNode [2020-10-20 01:49:06,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:49:06,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:49:06,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:49:06,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:49:06,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:49:06,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:49:06,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:49:06,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:49:06,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (1/1) ... [2020-10-20 01:49:06,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:49:06,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:49:06,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:49:06,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:49:06,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (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-10-20 01:49:06,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:49:06,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:49:06,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:49:06,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:49:07,479 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:49:07,479 INFO L298 CfgBuilder]: Removed 66 assume(true) statements. [2020-10-20 01:49:07,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:07 BoogieIcfgContainer [2020-10-20 01:49:07,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:49:07,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:49:07,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:49:07,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:49:07,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:49:06" (1/3) ... [2020-10-20 01:49:07,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662268c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:49:07, skipping insertion in model container [2020-10-20 01:49:07,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:06" (2/3) ... [2020-10-20 01:49:07,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662268c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:49:07, skipping insertion in model container [2020-10-20 01:49:07,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:07" (3/3) ... [2020-10-20 01:49:07,495 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2020-10-20 01:49:07,507 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:49:07,518 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:49:07,528 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:49:07,553 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:49:07,554 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:49:07,554 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:49:07,554 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:49:07,555 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:49:07,555 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:49:07,556 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:49:07,556 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:49:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2020-10-20 01:49:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 01:49:07,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:07,584 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-10-20 01:49:07,584 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2020-10-20 01:49:07,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:07,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239462884] [2020-10-20 01:49:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:07,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239462884] [2020-10-20 01:49:07,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:07,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:07,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280945904] [2020-10-20 01:49:07,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:07,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:07,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:07,809 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2020-10-20 01:49:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:07,874 INFO L93 Difference]: Finished difference Result 211 states and 353 transitions. [2020-10-20 01:49:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:07,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-20 01:49:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:07,889 INFO L225 Difference]: With dead ends: 211 [2020-10-20 01:49:07,890 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 01:49:07,893 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-10-20 01:49:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 01:49:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-20 01:49:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-20 01:49:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2020-10-20 01:49:07,941 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2020-10-20 01:49:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:07,941 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2020-10-20 01:49:07,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2020-10-20 01:49:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-20 01:49:07,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:07,945 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-10-20 01:49:07,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:49:07,945 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2020-10-20 01:49:07,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:07,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862583032] [2020-10-20 01:49:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:08,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862583032] [2020-10-20 01:49:08,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:08,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:08,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61559861] [2020-10-20 01:49:08,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:08,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:08,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:08,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:08,051 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2020-10-20 01:49:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:08,097 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2020-10-20 01:49:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:08,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-10-20 01:49:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:08,100 INFO L225 Difference]: With dead ends: 199 [2020-10-20 01:49:08,100 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 01:49:08,101 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-10-20 01:49:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 01:49:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-20 01:49:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-20 01:49:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2020-10-20 01:49:08,114 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2020-10-20 01:49:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:08,115 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2020-10-20 01:49:08,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2020-10-20 01:49:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-20 01:49:08,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:08,118 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-10-20 01:49:08,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:49:08,119 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2020-10-20 01:49:08,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:08,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188423368] [2020-10-20 01:49:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:08,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188423368] [2020-10-20 01:49:08,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:08,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:08,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170711532] [2020-10-20 01:49:08,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:08,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:08,223 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2020-10-20 01:49:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:08,255 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2020-10-20 01:49:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:08,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-10-20 01:49:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:08,257 INFO L225 Difference]: With dead ends: 196 [2020-10-20 01:49:08,257 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 01:49:08,258 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-10-20 01:49:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 01:49:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-20 01:49:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-20 01:49:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2020-10-20 01:49:08,268 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2020-10-20 01:49:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:08,269 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2020-10-20 01:49:08,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2020-10-20 01:49:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-20 01:49:08,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:08,272 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-10-20 01:49:08,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:49:08,272 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:08,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2020-10-20 01:49:08,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:08,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072149130] [2020-10-20 01:49:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:08,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072149130] [2020-10-20 01:49:08,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:08,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:08,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463344386] [2020-10-20 01:49:08,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:08,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:08,351 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2020-10-20 01:49:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:08,375 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2020-10-20 01:49:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:08,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-10-20 01:49:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:08,377 INFO L225 Difference]: With dead ends: 193 [2020-10-20 01:49:08,377 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 01:49:08,378 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-10-20 01:49:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 01:49:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-20 01:49:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-20 01:49:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2020-10-20 01:49:08,402 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2020-10-20 01:49:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:08,402 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2020-10-20 01:49:08,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2020-10-20 01:49:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-20 01:49:08,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:08,409 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-10-20 01:49:08,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:49:08,411 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2020-10-20 01:49:08,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:08,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283144187] [2020-10-20 01:49:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:08,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283144187] [2020-10-20 01:49:08,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:08,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:08,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412073736] [2020-10-20 01:49:08,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:08,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:08,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:08,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:08,485 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2020-10-20 01:49:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:08,526 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2020-10-20 01:49:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:08,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-10-20 01:49:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:08,529 INFO L225 Difference]: With dead ends: 271 [2020-10-20 01:49:08,529 INFO L226 Difference]: Without dead ends: 191 [2020-10-20 01:49:08,530 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-10-20 01:49:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-20 01:49:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2020-10-20 01:49:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-20 01:49:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2020-10-20 01:49:08,546 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2020-10-20 01:49:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:08,547 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2020-10-20 01:49:08,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2020-10-20 01:49:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-20 01:49:08,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:08,549 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-10-20 01:49:08,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:49:08,550 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2020-10-20 01:49:08,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:08,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296168076] [2020-10-20 01:49:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:08,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296168076] [2020-10-20 01:49:08,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:08,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:49:08,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487651716] [2020-10-20 01:49:08,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:49:08,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:49:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:08,663 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 6 states. [2020-10-20 01:49:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:08,784 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2020-10-20 01:49:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 01:49:08,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-10-20 01:49:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:08,787 INFO L225 Difference]: With dead ends: 444 [2020-10-20 01:49:08,787 INFO L226 Difference]: Without dead ends: 261 [2020-10-20 01:49:08,788 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-10-20 01:49:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-10-20 01:49:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2020-10-20 01:49:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-20 01:49:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2020-10-20 01:49:08,803 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2020-10-20 01:49:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:08,804 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2020-10-20 01:49:08,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:49:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2020-10-20 01:49:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-20 01:49:08,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:08,805 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-10-20 01:49:08,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:49:08,806 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2020-10-20 01:49:08,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:08,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143639971] [2020-10-20 01:49:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:08,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143639971] [2020-10-20 01:49:08,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:08,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:08,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242381615] [2020-10-20 01:49:08,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:08,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:08,866 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand 3 states. [2020-10-20 01:49:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:08,933 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2020-10-20 01:49:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:08,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-10-20 01:49:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:08,936 INFO L225 Difference]: With dead ends: 408 [2020-10-20 01:49:08,936 INFO L226 Difference]: Without dead ends: 271 [2020-10-20 01:49:08,937 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-10-20 01:49:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-10-20 01:49:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2020-10-20 01:49:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-20 01:49:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2020-10-20 01:49:08,951 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2020-10-20 01:49:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:08,951 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2020-10-20 01:49:08,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2020-10-20 01:49:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-20 01:49:08,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:08,953 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-10-20 01:49:08,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:49:08,953 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:08,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2020-10-20 01:49:08,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:08,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547059445] [2020-10-20 01:49:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:09,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547059445] [2020-10-20 01:49:09,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:09,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:09,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929890864] [2020-10-20 01:49:09,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:09,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:09,015 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand 5 states. [2020-10-20 01:49:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:09,098 INFO L93 Difference]: Finished difference Result 622 states and 975 transitions. [2020-10-20 01:49:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:09,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-10-20 01:49:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:09,101 INFO L225 Difference]: With dead ends: 622 [2020-10-20 01:49:09,101 INFO L226 Difference]: Without dead ends: 427 [2020-10-20 01:49:09,102 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-10-20 01:49:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-20 01:49:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 280. [2020-10-20 01:49:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-20 01:49:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2020-10-20 01:49:09,118 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2020-10-20 01:49:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:09,118 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2020-10-20 01:49:09,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2020-10-20 01:49:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-20 01:49:09,120 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:09,120 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-10-20 01:49:09,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:49:09,121 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:09,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:09,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2020-10-20 01:49:09,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:09,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227088718] [2020-10-20 01:49:09,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:09,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227088718] [2020-10-20 01:49:09,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:09,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:09,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181079428] [2020-10-20 01:49:09,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:09,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:09,179 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand 3 states. [2020-10-20 01:49:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:09,236 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2020-10-20 01:49:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:09,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-20 01:49:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:09,239 INFO L225 Difference]: With dead ends: 563 [2020-10-20 01:49:09,239 INFO L226 Difference]: Without dead ends: 332 [2020-10-20 01:49:09,240 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-10-20 01:49:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-20 01:49:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2020-10-20 01:49:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-10-20 01:49:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2020-10-20 01:49:09,255 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2020-10-20 01:49:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:09,255 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2020-10-20 01:49:09,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2020-10-20 01:49:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-20 01:49:09,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:09,257 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-10-20 01:49:09,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:49:09,258 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:09,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2020-10-20 01:49:09,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:09,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845424035] [2020-10-20 01:49:09,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:09,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845424035] [2020-10-20 01:49:09,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:09,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:09,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864517139] [2020-10-20 01:49:09,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:09,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:09,291 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand 3 states. [2020-10-20 01:49:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:09,325 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2020-10-20 01:49:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:09,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-20 01:49:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:09,328 INFO L225 Difference]: With dead ends: 567 [2020-10-20 01:49:09,328 INFO L226 Difference]: Without dead ends: 284 [2020-10-20 01:49:09,329 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-10-20 01:49:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-10-20 01:49:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-10-20 01:49:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-20 01:49:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2020-10-20 01:49:09,357 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2020-10-20 01:49:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:09,357 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2020-10-20 01:49:09,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2020-10-20 01:49:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-20 01:49:09,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:09,359 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-10-20 01:49:09,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:49:09,360 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2020-10-20 01:49:09,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:09,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355940248] [2020-10-20 01:49:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:09,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355940248] [2020-10-20 01:49:09,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:09,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:09,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819189558] [2020-10-20 01:49:09,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:09,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:09,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:09,452 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2020-10-20 01:49:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:09,507 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2020-10-20 01:49:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:09,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-10-20 01:49:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:09,512 INFO L225 Difference]: With dead ends: 811 [2020-10-20 01:49:09,513 INFO L226 Difference]: Without dead ends: 580 [2020-10-20 01:49:09,514 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-10-20 01:49:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-10-20 01:49:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2020-10-20 01:49:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-10-20 01:49:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2020-10-20 01:49:09,555 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2020-10-20 01:49:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:09,556 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2020-10-20 01:49:09,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2020-10-20 01:49:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-20 01:49:09,558 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:09,558 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-10-20 01:49:09,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:49:09,559 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2020-10-20 01:49:09,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:09,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424869317] [2020-10-20 01:49:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:09,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424869317] [2020-10-20 01:49:09,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:09,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:09,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768804938] [2020-10-20 01:49:09,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:09,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:09,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:09,639 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand 5 states. [2020-10-20 01:49:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:09,723 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2020-10-20 01:49:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:49:09,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-10-20 01:49:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:09,726 INFO L225 Difference]: With dead ends: 1097 [2020-10-20 01:49:09,727 INFO L226 Difference]: Without dead ends: 574 [2020-10-20 01:49:09,728 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-10-20 01:49:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-10-20 01:49:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2020-10-20 01:49:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-10-20 01:49:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2020-10-20 01:49:09,757 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2020-10-20 01:49:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:09,759 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2020-10-20 01:49:09,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2020-10-20 01:49:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-20 01:49:09,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:09,761 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-10-20 01:49:09,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:49:09,761 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2020-10-20 01:49:09,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:09,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006600027] [2020-10-20 01:49:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:09,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006600027] [2020-10-20 01:49:09,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:09,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:09,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198421923] [2020-10-20 01:49:09,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:09,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:09,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:09,809 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand 3 states. [2020-10-20 01:49:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:09,903 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2020-10-20 01:49:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:09,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-10-20 01:49:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:09,909 INFO L225 Difference]: With dead ends: 1592 [2020-10-20 01:49:09,910 INFO L226 Difference]: Without dead ends: 1069 [2020-10-20 01:49:09,911 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-10-20 01:49:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2020-10-20 01:49:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2020-10-20 01:49:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-10-20 01:49:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2020-10-20 01:49:09,950 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2020-10-20 01:49:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:09,950 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2020-10-20 01:49:09,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2020-10-20 01:49:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-20 01:49:09,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:09,952 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-10-20 01:49:09,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:49:09,953 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2020-10-20 01:49:09,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:09,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343618814] [2020-10-20 01:49:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:10,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343618814] [2020-10-20 01:49:10,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:10,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:10,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963636122] [2020-10-20 01:49:10,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:10,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:10,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:10,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:10,023 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand 5 states. [2020-10-20 01:49:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:10,112 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2020-10-20 01:49:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:49:10,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-10-20 01:49:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:10,116 INFO L225 Difference]: With dead ends: 1105 [2020-10-20 01:49:10,116 INFO L226 Difference]: Without dead ends: 570 [2020-10-20 01:49:10,118 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-10-20 01:49:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-10-20 01:49:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-10-20 01:49:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-10-20 01:49:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2020-10-20 01:49:10,166 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2020-10-20 01:49:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:10,168 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2020-10-20 01:49:10,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2020-10-20 01:49:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-20 01:49:10,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:10,170 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-10-20 01:49:10,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:49:10,171 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2020-10-20 01:49:10,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:10,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308689576] [2020-10-20 01:49:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:10,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308689576] [2020-10-20 01:49:10,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:10,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:10,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607008866] [2020-10-20 01:49:10,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:10,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:10,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:10,213 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand 3 states. [2020-10-20 01:49:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:10,292 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2020-10-20 01:49:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:10,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-10-20 01:49:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:10,298 INFO L225 Difference]: With dead ends: 1592 [2020-10-20 01:49:10,298 INFO L226 Difference]: Without dead ends: 1073 [2020-10-20 01:49:10,301 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-10-20 01:49:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2020-10-20 01:49:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2020-10-20 01:49:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-10-20 01:49:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2020-10-20 01:49:10,360 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2020-10-20 01:49:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:10,360 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2020-10-20 01:49:10,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2020-10-20 01:49:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-20 01:49:10,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:10,362 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-10-20 01:49:10,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:49:10,363 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2020-10-20 01:49:10,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:10,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026766141] [2020-10-20 01:49:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:10,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026766141] [2020-10-20 01:49:10,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:10,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:10,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655232875] [2020-10-20 01:49:10,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:10,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:10,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:10,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:10,407 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand 3 states. [2020-10-20 01:49:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:10,467 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2020-10-20 01:49:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:10,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-10-20 01:49:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:10,484 INFO L225 Difference]: With dead ends: 1311 [2020-10-20 01:49:10,484 INFO L226 Difference]: Without dead ends: 784 [2020-10-20 01:49:10,486 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-10-20 01:49:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-10-20 01:49:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2020-10-20 01:49:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-10-20 01:49:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2020-10-20 01:49:10,543 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2020-10-20 01:49:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:10,543 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2020-10-20 01:49:10,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2020-10-20 01:49:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-20 01:49:10,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:10,545 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-10-20 01:49:10,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:49:10,546 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2020-10-20 01:49:10,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:10,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645032429] [2020-10-20 01:49:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:10,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645032429] [2020-10-20 01:49:10,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196739114] [2020-10-20 01:49:10,607 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-10-20 01:49:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:10,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 01:49:10,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:10,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:10,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-20 01:49:10,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311566549] [2020-10-20 01:49:10,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:10,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:10,891 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand 3 states. [2020-10-20 01:49:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:10,989 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2020-10-20 01:49:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:10,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-10-20 01:49:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:10,994 INFO L225 Difference]: With dead ends: 1341 [2020-10-20 01:49:10,995 INFO L226 Difference]: Without dead ends: 686 [2020-10-20 01:49:10,996 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-10-20 01:49:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-10-20 01:49:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2020-10-20 01:49:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-10-20 01:49:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2020-10-20 01:49:11,090 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2020-10-20 01:49:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:11,091 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2020-10-20 01:49:11,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2020-10-20 01:49:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-20 01:49:11,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:11,094 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-10-20 01:49:11,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-20 01:49:11,309 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2020-10-20 01:49:11,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:11,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683530371] [2020-10-20 01:49:11,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:11,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683530371] [2020-10-20 01:49:11,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716727346] [2020-10-20 01:49:11,377 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-10-20 01:49:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:11,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 01:49:11,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:11,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:11,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-20 01:49:11,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146443639] [2020-10-20 01:49:11,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:11,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:11,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:11,569 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand 3 states. [2020-10-20 01:49:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:11,744 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2020-10-20 01:49:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:11,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-20 01:49:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:11,755 INFO L225 Difference]: With dead ends: 2025 [2020-10-20 01:49:11,755 INFO L226 Difference]: Without dead ends: 1364 [2020-10-20 01:49:11,757 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-10-20 01:49:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-10-20 01:49:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2020-10-20 01:49:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2020-10-20 01:49:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2020-10-20 01:49:11,902 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2020-10-20 01:49:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:11,902 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2020-10-20 01:49:11,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2020-10-20 01:49:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-20 01:49:11,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:11,905 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-10-20 01:49:12,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-20 01:49:12,118 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2020-10-20 01:49:12,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:12,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747436579] [2020-10-20 01:49:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:12,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747436579] [2020-10-20 01:49:12,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:12,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:12,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396921033] [2020-10-20 01:49:12,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:12,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:12,162 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand 3 states. [2020-10-20 01:49:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:12,306 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2020-10-20 01:49:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:12,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-20 01:49:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:12,313 INFO L225 Difference]: With dead ends: 2736 [2020-10-20 01:49:12,314 INFO L226 Difference]: Without dead ends: 1463 [2020-10-20 01:49:12,318 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-10-20 01:49:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-10-20 01:49:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2020-10-20 01:49:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2020-10-20 01:49:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2020-10-20 01:49:12,412 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2020-10-20 01:49:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:12,412 INFO L481 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2020-10-20 01:49:12,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2020-10-20 01:49:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-20 01:49:12,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:12,415 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-10-20 01:49:12,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:49:12,416 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2020-10-20 01:49:12,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:12,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773908389] [2020-10-20 01:49:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:12,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-10-20 01:49:12,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773908389] [2020-10-20 01:49:12,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:12,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:12,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026482087] [2020-10-20 01:49:12,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:12,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:12,495 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand 3 states. [2020-10-20 01:49:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:12,603 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2020-10-20 01:49:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:12,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-20 01:49:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:12,611 INFO L225 Difference]: With dead ends: 2354 [2020-10-20 01:49:12,611 INFO L226 Difference]: Without dead ends: 973 [2020-10-20 01:49:12,614 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-10-20 01:49:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-10-20 01:49:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2020-10-20 01:49:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2020-10-20 01:49:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2020-10-20 01:49:12,682 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2020-10-20 01:49:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:12,682 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2020-10-20 01:49:12,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2020-10-20 01:49:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-20 01:49:12,685 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:12,685 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-10-20 01:49:12,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:49:12,686 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2020-10-20 01:49:12,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:12,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200659498] [2020-10-20 01:49:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:12,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200659498] [2020-10-20 01:49:12,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:12,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:12,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441944461] [2020-10-20 01:49:12,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:12,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:12,746 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand 4 states. [2020-10-20 01:49:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:12,796 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2020-10-20 01:49:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:12,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-10-20 01:49:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:12,799 INFO L225 Difference]: With dead ends: 1258 [2020-10-20 01:49:12,800 INFO L226 Difference]: Without dead ends: 373 [2020-10-20 01:49:12,801 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-10-20 01:49:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-10-20 01:49:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-10-20 01:49:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-20 01:49:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2020-10-20 01:49:12,826 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2020-10-20 01:49:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:12,827 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2020-10-20 01:49:12,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2020-10-20 01:49:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-20 01:49:12,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:12,829 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-10-20 01:49:12,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:49:12,829 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2020-10-20 01:49:12,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:12,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281751765] [2020-10-20 01:49:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:12,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281751765] [2020-10-20 01:49:12,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068894090] [2020-10-20 01:49:12,912 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-10-20 01:49:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:13,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 01:49:13,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:13,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:13,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-20 01:49:13,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627165159] [2020-10-20 01:49:13,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:13,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:13,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:13,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:13,074 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand 3 states. [2020-10-20 01:49:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:13,161 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2020-10-20 01:49:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:13,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-20 01:49:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:13,166 INFO L225 Difference]: With dead ends: 1059 [2020-10-20 01:49:13,166 INFO L226 Difference]: Without dead ends: 732 [2020-10-20 01:49:13,167 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-10-20 01:49:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-20 01:49:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2020-10-20 01:49:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2020-10-20 01:49:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2020-10-20 01:49:13,215 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2020-10-20 01:49:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:13,215 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2020-10-20 01:49:13,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2020-10-20 01:49:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-20 01:49:13,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:13,218 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-10-20 01:49:13,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-10-20 01:49:13,432 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2020-10-20 01:49:13,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:13,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830021633] [2020-10-20 01:49:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:13,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830021633] [2020-10-20 01:49:13,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:13,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:13,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082843900] [2020-10-20 01:49:13,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:13,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:13,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:13,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:13,470 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand 3 states. [2020-10-20 01:49:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:13,546 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2020-10-20 01:49:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:13,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-20 01:49:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:13,551 INFO L225 Difference]: With dead ends: 1382 [2020-10-20 01:49:13,551 INFO L226 Difference]: Without dead ends: 811 [2020-10-20 01:49:13,553 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-10-20 01:49:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-10-20 01:49:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2020-10-20 01:49:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2020-10-20 01:49:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2020-10-20 01:49:13,602 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2020-10-20 01:49:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:13,603 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2020-10-20 01:49:13,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2020-10-20 01:49:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-20 01:49:13,605 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:13,606 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-10-20 01:49:13,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:49:13,606 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2020-10-20 01:49:13,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:13,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219017671] [2020-10-20 01:49:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:13,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219017671] [2020-10-20 01:49:13,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:13,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:13,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749976754] [2020-10-20 01:49:13,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:13,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:13,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:13,635 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand 3 states. [2020-10-20 01:49:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:13,693 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2020-10-20 01:49:13,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:13,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-20 01:49:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:13,697 INFO L225 Difference]: With dead ends: 1208 [2020-10-20 01:49:13,697 INFO L226 Difference]: Without dead ends: 551 [2020-10-20 01:49:13,698 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-10-20 01:49:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-10-20 01:49:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2020-10-20 01:49:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-10-20 01:49:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2020-10-20 01:49:13,731 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2020-10-20 01:49:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:13,732 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2020-10-20 01:49:13,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2020-10-20 01:49:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:49:13,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:13,734 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-10-20 01:49:13,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 01:49:13,734 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2020-10-20 01:49:13,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:13,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557973263] [2020-10-20 01:49:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:13,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557973263] [2020-10-20 01:49:13,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:13,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:13,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363117176] [2020-10-20 01:49:13,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:13,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:13,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:13,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:13,792 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand 4 states. [2020-10-20 01:49:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:13,832 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2020-10-20 01:49:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:13,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-20 01:49:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:13,835 INFO L225 Difference]: With dead ends: 820 [2020-10-20 01:49:13,835 INFO L226 Difference]: Without dead ends: 427 [2020-10-20 01:49:13,838 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-10-20 01:49:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-20 01:49:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-10-20 01:49:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-20 01:49:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2020-10-20 01:49:13,882 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2020-10-20 01:49:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:13,883 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2020-10-20 01:49:13,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2020-10-20 01:49:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:49:13,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:13,887 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-10-20 01:49:13,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 01:49:13,888 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2020-10-20 01:49:13,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:13,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753529920] [2020-10-20 01:49:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:13,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753529920] [2020-10-20 01:49:13,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045814324] [2020-10-20 01:49:13,971 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-10-20 01:49:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:14,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 01:49:14,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:49:14,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:14,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-20 01:49:14,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311689517] [2020-10-20 01:49:14,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:14,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:14,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:14,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:14,165 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand 3 states. [2020-10-20 01:49:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:14,278 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2020-10-20 01:49:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:14,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-10-20 01:49:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:14,283 INFO L225 Difference]: With dead ends: 1163 [2020-10-20 01:49:14,284 INFO L226 Difference]: Without dead ends: 822 [2020-10-20 01:49:14,285 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-10-20 01:49:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-10-20 01:49:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2020-10-20 01:49:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-20 01:49:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2020-10-20 01:49:14,371 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2020-10-20 01:49:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:14,372 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2020-10-20 01:49:14,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2020-10-20 01:49:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:49:14,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:14,376 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-10-20 01:49:14,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:14,590 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2020-10-20 01:49:14,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:14,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684118672] [2020-10-20 01:49:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:14,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684118672] [2020-10-20 01:49:14,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828223950] [2020-10-20 01:49:14,641 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-10-20 01:49:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:14,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 01:49:14,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:14,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:14,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-10-20 01:49:14,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321504314] [2020-10-20 01:49:14,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:14,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:14,807 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand 4 states. [2020-10-20 01:49:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:14,914 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2020-10-20 01:49:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:14,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-20 01:49:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:14,920 INFO L225 Difference]: With dead ends: 1704 [2020-10-20 01:49:14,920 INFO L226 Difference]: Without dead ends: 1054 [2020-10-20 01:49:14,922 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-10-20 01:49:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2020-10-20 01:49:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2020-10-20 01:49:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2020-10-20 01:49:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2020-10-20 01:49:15,014 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2020-10-20 01:49:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:15,015 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2020-10-20 01:49:15,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2020-10-20 01:49:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:49:15,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:15,018 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-10-20 01:49:15,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-20 01:49:15,230 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2020-10-20 01:49:15,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:15,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957256512] [2020-10-20 01:49:15,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:15,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957256512] [2020-10-20 01:49:15,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:15,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:15,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519434670] [2020-10-20 01:49:15,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:15,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:15,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:15,295 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand 4 states. [2020-10-20 01:49:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:15,463 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2020-10-20 01:49:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:15,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-20 01:49:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:15,473 INFO L225 Difference]: With dead ends: 2540 [2020-10-20 01:49:15,473 INFO L226 Difference]: Without dead ends: 1698 [2020-10-20 01:49:15,476 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-10-20 01:49:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2020-10-20 01:49:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2020-10-20 01:49:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2020-10-20 01:49:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2020-10-20 01:49:15,593 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2020-10-20 01:49:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:15,593 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2020-10-20 01:49:15,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2020-10-20 01:49:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:49:15,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:15,596 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-10-20 01:49:15,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 01:49:15,596 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2020-10-20 01:49:15,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:15,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907231575] [2020-10-20 01:49:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:15,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907231575] [2020-10-20 01:49:15,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:15,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:15,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429368495] [2020-10-20 01:49:15,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:15,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:15,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:15,683 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand 5 states. [2020-10-20 01:49:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:15,759 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2020-10-20 01:49:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:49:15,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-10-20 01:49:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:15,761 INFO L225 Difference]: With dead ends: 1285 [2020-10-20 01:49:15,761 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:49:15,765 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-10-20 01:49:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:49:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:49:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:49:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:49:15,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2020-10-20 01:49:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:15,767 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:49:15,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:49:15,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:49:15,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 01:49:15,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:49:16,252 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2020-10-20 01:49:17,045 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-20 01:49:17,223 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-20 01:49:17,456 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-10-20 01:49:17,694 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-20 01:49:17,881 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-10-20 01:49:18,053 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-20 01:49:18,240 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-20 01:49:18,371 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-20 01:49:18,698 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2020-10-20 01:49:18,903 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-20 01:49:19,013 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-20 01:49:19,189 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-20 01:49:19,351 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-20 01:49:19,566 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-20 01:49:19,679 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-10-20 01:49:19,874 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-20 01:49:20,042 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-10-20 01:49:20,243 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-10-20 01:49:20,507 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-10-20 01:49:20,759 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2020-10-20 01:49:20,886 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-20 01:49:21,023 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-20 01:49:21,218 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-10-20 01:49:21,375 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-10-20 01:49:21,549 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-10-20 01:49:21,552 INFO L274 CegarLoopResult]: For program point L399(lines 399 404) no Hoare annotation was computed. [2020-10-20 01:49:21,553 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,554 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,554 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,554 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,555 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,555 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 01:49:21,557 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,558 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,558 INFO L274 CegarLoopResult]: For program point L103(lines 103 118) no Hoare annotation was computed. [2020-10-20 01:49:21,558 INFO L274 CegarLoopResult]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2020-10-20 01:49:21,558 INFO L274 CegarLoopResult]: For program point L71(lines 43 93) no Hoare annotation was computed. [2020-10-20 01:49:21,559 INFO L277 CegarLoopResult]: At program point L501(lines 485 503) the Hoare annotation is: true [2020-10-20 01:49:21,559 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,559 INFO L274 CegarLoopResult]: For program point L204(lines 204 210) no Hoare annotation was computed. [2020-10-20 01:49:21,559 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,560 INFO L274 CegarLoopResult]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2020-10-20 01:49:21,560 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,560 INFO L274 CegarLoopResult]: For program point L72(lines 72 76) no Hoare annotation was computed. [2020-10-20 01:49:21,560 INFO L274 CegarLoopResult]: For program point L107(lines 107 117) no Hoare annotation was computed. [2020-10-20 01:49:21,561 INFO L274 CegarLoopResult]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2020-10-20 01:49:21,561 INFO L274 CegarLoopResult]: For program point L174(lines 174 179) no Hoare annotation was computed. [2020-10-20 01:49:21,561 INFO L274 CegarLoopResult]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2020-10-20 01:49:21,561 INFO L274 CegarLoopResult]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2020-10-20 01:49:21,562 INFO L274 CegarLoopResult]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2020-10-20 01:49:21,563 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,564 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,564 INFO L274 CegarLoopResult]: For program point L44(lines 44 52) no Hoare annotation was computed. [2020-10-20 01:49:21,564 INFO L274 CegarLoopResult]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2020-10-20 01:49:21,564 INFO L274 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-10-20 01:49:21,564 INFO L274 CegarLoopResult]: For program point L441(lines 441 445) no Hoare annotation was computed. [2020-10-20 01:49:21,565 INFO L274 CegarLoopResult]: For program point L144(lines 144 149) no Hoare annotation was computed. [2020-10-20 01:49:21,565 INFO L274 CegarLoopResult]: For program point L111(lines 111 116) no Hoare annotation was computed. [2020-10-20 01:49:21,565 INFO L274 CegarLoopResult]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2020-10-20 01:49:21,565 INFO L274 CegarLoopResult]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2020-10-20 01:49:21,565 INFO L274 CegarLoopResult]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-10-20 01:49:21,566 INFO L274 CegarLoopResult]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2020-10-20 01:49:21,566 INFO L274 CegarLoopResult]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2020-10-20 01:49:21,566 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,566 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,567 INFO L274 CegarLoopResult]: For program point L278(line 278) no Hoare annotation was computed. [2020-10-20 01:49:21,567 INFO L274 CegarLoopResult]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,567 INFO L274 CegarLoopResult]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,567 INFO L274 CegarLoopResult]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2020-10-20 01:49:21,567 INFO L274 CegarLoopResult]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,568 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,568 INFO L274 CegarLoopResult]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,568 INFO L274 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-10-20 01:49:21,569 INFO L274 CegarLoopResult]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2020-10-20 01:49:21,569 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,569 INFO L274 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-10-20 01:49:21,569 INFO L274 CegarLoopResult]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2020-10-20 01:49:21,570 INFO L274 CegarLoopResult]: For program point L382(lines 382 386) no Hoare annotation was computed. [2020-10-20 01:49:21,570 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,570 INFO L274 CegarLoopResult]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2020-10-20 01:49:21,571 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,571 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,571 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:49:21,572 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,572 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,572 INFO L274 CegarLoopResult]: For program point L53(lines 43 93) no Hoare annotation was computed. [2020-10-20 01:49:21,572 INFO L274 CegarLoopResult]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,572 INFO L274 CegarLoopResult]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,573 INFO L274 CegarLoopResult]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,573 INFO L274 CegarLoopResult]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,573 INFO L274 CegarLoopResult]: For program point L54(lines 54 58) no Hoare annotation was computed. [2020-10-20 01:49:21,573 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,573 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,574 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,574 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,574 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,575 INFO L274 CegarLoopResult]: For program point L189(lines 189 194) no Hoare annotation was computed. [2020-10-20 01:49:21,575 INFO L274 CegarLoopResult]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2020-10-20 01:49:21,575 INFO L274 CegarLoopResult]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2020-10-20 01:49:21,575 INFO L274 CegarLoopResult]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2020-10-20 01:49:21,575 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:49:21,575 INFO L274 CegarLoopResult]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,576 INFO L274 CegarLoopResult]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,576 INFO L274 CegarLoopResult]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,576 INFO L274 CegarLoopResult]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,576 INFO L274 CegarLoopResult]: For program point L291(lines 291 298) no Hoare annotation was computed. [2020-10-20 01:49:21,576 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,577 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,577 INFO L274 CegarLoopResult]: For program point L159(lines 159 164) no Hoare annotation was computed. [2020-10-20 01:49:21,577 INFO L274 CegarLoopResult]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2020-10-20 01:49:21,578 INFO L274 CegarLoopResult]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2020-10-20 01:49:21,578 INFO L274 CegarLoopResult]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2020-10-20 01:49:21,578 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,578 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:49:21,578 INFO L274 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2020-10-20 01:49:21,579 INFO L274 CegarLoopResult]: For program point L260(lines 260 265) no Hoare annotation was computed. [2020-10-20 01:49:21,579 INFO L274 CegarLoopResult]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2020-10-20 01:49:21,579 INFO L274 CegarLoopResult]: For program point L129(lines 129 134) no Hoare annotation was computed. [2020-10-20 01:49:21,580 INFO L274 CegarLoopResult]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2020-10-20 01:49:21,580 INFO L274 CegarLoopResult]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2020-10-20 01:49:21,581 INFO L274 CegarLoopResult]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2020-10-20 01:49:21,581 INFO L277 CegarLoopResult]: At program point L493(lines 493 499) the Hoare annotation is: true [2020-10-20 01:49:21,581 INFO L274 CegarLoopResult]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,581 INFO L274 CegarLoopResult]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,581 INFO L274 CegarLoopResult]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2020-10-20 01:49:21,581 INFO L274 CegarLoopResult]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2020-10-20 01:49:21,582 INFO L274 CegarLoopResult]: For program point L65(lines 65 69) no Hoare annotation was computed. [2020-10-20 01:49:21,582 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:49:21,582 INFO L274 CegarLoopResult]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2020-10-20 01:49:21,582 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:49:21,582 INFO L274 CegarLoopResult]: For program point L99(lines 99 119) no Hoare annotation was computed. [2020-10-20 01:49:21,582 INFO L274 CegarLoopResult]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2020-10-20 01:49:21,583 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,583 INFO L270 CegarLoopResult]: 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-10-20 01:49:21,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:49:21 BoogieIcfgContainer [2020-10-20 01:49:21,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:49:21,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:49:21,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:49:21,694 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:49:21,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:07" (3/4) ... [2020-10-20 01:49:21,699 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:49:21,722 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:49:21,723 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:49:21,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:49:21,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:49:21,760 WARN L221 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-10-20 01:49:21,763 WARN L221 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-10-20 01:49:21,764 WARN L221 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-10-20 01:49:21,853 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:49:21,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:49:21,855 INFO L168 Benchmark]: Toolchain (without parser) took 15608.69 ms. Allocated memory was 34.1 MB in the beginning and 159.9 MB in the end (delta: 125.8 MB). Free memory was 15.1 MB in the beginning and 58.5 MB in the end (delta: -43.4 MB). Peak memory consumption was 82.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,856 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 32.5 MB. Free memory was 10.0 MB in the beginning and 10.0 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.19 ms. Allocated memory was 34.1 MB in the beginning and 42.5 MB in the end (delta: 8.4 MB). Free memory was 14.3 MB in the beginning and 20.7 MB in the end (delta: -6.4 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.62 ms. Allocated memory is still 42.5 MB. Free memory was 20.7 MB in the beginning and 18.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,857 INFO L168 Benchmark]: Boogie Preprocessor took 36.04 ms. Allocated memory is still 42.5 MB. Free memory was 18.1 MB in the beginning and 16.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,857 INFO L168 Benchmark]: RCFGBuilder took 673.00 ms. Allocated memory was 42.5 MB in the beginning and 45.1 MB in the end (delta: 2.6 MB). Free memory was 15.8 MB in the beginning and 23.3 MB in the end (delta: -7.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,858 INFO L168 Benchmark]: TraceAbstraction took 14207.41 ms. Allocated memory was 45.1 MB in the beginning and 159.9 MB in the end (delta: 114.8 MB). Free memory was 22.7 MB in the beginning and 71.6 MB in the end (delta: -48.9 MB). Peak memory consumption was 130.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,859 INFO L168 Benchmark]: Witness Printer took 160.37 ms. Allocated memory is still 159.9 MB. Free memory was 71.6 MB in the beginning and 58.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:49:21,867 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.78 ms. Allocated memory is still 32.5 MB. Free memory was 10.0 MB in the beginning and 10.0 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 466.19 ms. Allocated memory was 34.1 MB in the beginning and 42.5 MB in the end (delta: 8.4 MB). Free memory was 14.3 MB in the beginning and 20.7 MB in the end (delta: -6.4 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 50.62 ms. Allocated memory is still 42.5 MB. Free memory was 20.7 MB in the beginning and 18.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 36.04 ms. Allocated memory is still 42.5 MB. Free memory was 18.1 MB in the beginning and 16.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 673.00 ms. Allocated memory was 42.5 MB in the beginning and 45.1 MB in the end (delta: 2.6 MB). Free memory was 15.8 MB in the beginning and 23.3 MB in the end (delta: -7.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. * TraceAbstraction took 14207.41 ms. Allocated memory was 45.1 MB in the beginning and 159.9 MB in the end (delta: 114.8 MB). Free memory was 22.7 MB in the beginning and 71.6 MB in the end (delta: -48.9 MB). Peak memory consumption was 130.1 MB. Max. memory is 14.3 GB. * Witness Printer took 160.37 ms. Allocated memory is still 159.9 MB. Free memory was 71.6 MB in the beginning and 58.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() 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, 109 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.2s, OverallIterations: 29, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4787 SDtfs, 2705 SDslu, 5016 SDs, 0 SdLazy, 402 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s 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.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 2015 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3750 HoareAnnotationTreeSize, 33 FomulaSimplifications, 39368 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 33 FomulaSimplificationsInter, 14097 FormulaSimplificationTreeSizeReductionInter, 4.5s 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, 1 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...