./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 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC --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.2.0-7b2dab5 [2021-10-11 00:27:32,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:27:32,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:27:33,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:27:33,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:27:33,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:27:33,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:27:33,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:27:33,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:27:33,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:27:33,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:27:33,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:27:33,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:27:33,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:27:33,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:27:33,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:27:33,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:27:33,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:27:33,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:27:33,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:27:33,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:27:33,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:27:33,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:27:33,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:27:33,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:27:33,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:27:33,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:27:33,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:27:33,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:27:33,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:27:33,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:27:33,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:27:33,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:27:33,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:27:33,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:27:33,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:27:33,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:27:33,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:27:33,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:27:33,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:27:33,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:27:33,167 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:27:33,218 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:27:33,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:27:33,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:27:33,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:27:33,221 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:27:33,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:27:33,222 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:27:33,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:27:33,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:27:33,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:27:33,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:27:33,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:27:33,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:27:33,233 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:27:33,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:27:33,233 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:27:33,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:27:33,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:27:33,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:27:33,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:27:33,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:27:33,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:27:33,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:27:33,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:27:33,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:27:33,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:27:33,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:27:33,237 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:27:33,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC 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 [2021-10-11 00:27:33,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:27:33,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:27:33,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:27:33,639 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:27:33,640 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:27:33,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-10-11 00:27:33,748 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/data/4d9f91f9e/dfc25fcbd9984ec6a657268bfa6e2b21/FLAGfc1694def [2021-10-11 00:27:34,410 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:27:34,413 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-10-11 00:27:34,432 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/data/4d9f91f9e/dfc25fcbd9984ec6a657268bfa6e2b21/FLAGfc1694def [2021-10-11 00:27:34,722 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/data/4d9f91f9e/dfc25fcbd9984ec6a657268bfa6e2b21 [2021-10-11 00:27:34,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:27:34,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:27:34,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:27:34,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:27:34,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:27:34,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:27:34" (1/1) ... [2021-10-11 00:27:34,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bfe35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:34, skipping insertion in model container [2021-10-11 00:27:34,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:27:34" (1/1) ... [2021-10-11 00:27:34,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:27:34,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:27:34,973 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-10-11 00:27:35,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:27:35,055 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:27:35,067 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-10-11 00:27:35,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:27:35,121 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:27:35,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35 WrapperNode [2021-10-11 00:27:35,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:27:35,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:27:35,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:27:35,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:27:35,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:27:35,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:27:35,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:27:35,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:27:35,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... [2021-10-11 00:27:35,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:27:35,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:27:35,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:27:35,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:27:35,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:27:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:27:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:27:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:27:35,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:27:36,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:27:36,217 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2021-10-11 00:27:36,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:27:36 BoogieIcfgContainer [2021-10-11 00:27:36,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:27:36,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:27:36,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:27:36,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:27:36,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:27:34" (1/3) ... [2021-10-11 00:27:36,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db9ecd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:27:36, skipping insertion in model container [2021-10-11 00:27:36,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:27:35" (2/3) ... [2021-10-11 00:27:36,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db9ecd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:27:36, skipping insertion in model container [2021-10-11 00:27:36,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:27:36" (3/3) ... [2021-10-11 00:27:36,257 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-10-11 00:27:36,275 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:27:36,279 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 00:27:36,291 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 00:27:36,320 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:27:36,320 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:27:36,321 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:27:36,321 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:27:36,321 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:27:36,321 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:27:36,322 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:27:36,322 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:27:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2021-10-11 00:27:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 00:27:36,351 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:36,353 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] [2021-10-11 00:27:36,354 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2021-10-11 00:27:36,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:36,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019046443] [2021-10-11 00:27:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:36,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019046443] [2021-10-11 00:27:36,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:36,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:36,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011629690] [2021-10-11 00:27:36,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:36,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:36,779 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2021-10-11 00:27:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:36,888 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2021-10-11 00:27:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:36,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-10-11 00:27:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:36,919 INFO L225 Difference]: With dead ends: 210 [2021-10-11 00:27:36,933 INFO L226 Difference]: Without dead ends: 104 [2021-10-11 00:27:36,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 [2021-10-11 00:27:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-11 00:27:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-11 00:27:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-10-11 00:27:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2021-10-11 00:27:37,018 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2021-10-11 00:27:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:37,019 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2021-10-11 00:27:37,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2021-10-11 00:27:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-11 00:27:37,027 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:37,027 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] [2021-10-11 00:27:37,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:27:37,028 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:37,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2021-10-11 00:27:37,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:37,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529325183] [2021-10-11 00:27:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:37,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529325183] [2021-10-11 00:27:37,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:37,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:37,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418206430] [2021-10-11 00:27:37,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:37,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:37,211 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2021-10-11 00:27:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:37,261 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2021-10-11 00:27:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:37,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-10-11 00:27:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:37,264 INFO L225 Difference]: With dead ends: 199 [2021-10-11 00:27:37,265 INFO L226 Difference]: Without dead ends: 104 [2021-10-11 00:27:37,267 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 [2021-10-11 00:27:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-11 00:27:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-11 00:27:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-10-11 00:27:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2021-10-11 00:27:37,287 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2021-10-11 00:27:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:37,287 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2021-10-11 00:27:37,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2021-10-11 00:27:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-11 00:27:37,294 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:37,295 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] [2021-10-11 00:27:37,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:27:37,296 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:37,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2021-10-11 00:27:37,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:37,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420423882] [2021-10-11 00:27:37,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:37,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420423882] [2021-10-11 00:27:37,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:37,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:37,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699558461] [2021-10-11 00:27:37,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:37,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:37,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:37,408 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2021-10-11 00:27:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:37,428 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2021-10-11 00:27:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:37,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-10-11 00:27:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:37,431 INFO L225 Difference]: With dead ends: 196 [2021-10-11 00:27:37,431 INFO L226 Difference]: Without dead ends: 104 [2021-10-11 00:27:37,432 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 [2021-10-11 00:27:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-11 00:27:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-11 00:27:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-10-11 00:27:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2021-10-11 00:27:37,443 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2021-10-11 00:27:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:37,444 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2021-10-11 00:27:37,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2021-10-11 00:27:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-11 00:27:37,446 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:37,446 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] [2021-10-11 00:27:37,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:27:37,447 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:37,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2021-10-11 00:27:37,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:37,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754413352] [2021-10-11 00:27:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:37,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754413352] [2021-10-11 00:27:37,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:37,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:37,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677406701] [2021-10-11 00:27:37,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:37,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:37,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:37,531 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2021-10-11 00:27:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:37,558 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2021-10-11 00:27:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:37,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-10-11 00:27:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:37,562 INFO L225 Difference]: With dead ends: 193 [2021-10-11 00:27:37,562 INFO L226 Difference]: Without dead ends: 104 [2021-10-11 00:27:37,564 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 [2021-10-11 00:27:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-11 00:27:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-11 00:27:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2021-10-11 00:27:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2021-10-11 00:27:37,591 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2021-10-11 00:27:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:37,593 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2021-10-11 00:27:37,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2021-10-11 00:27:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 00:27:37,597 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:37,597 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] [2021-10-11 00:27:37,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:27:37,598 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:37,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2021-10-11 00:27:37,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:37,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542126400] [2021-10-11 00:27:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:37,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542126400] [2021-10-11 00:27:37,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:37,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:37,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538048287] [2021-10-11 00:27:37,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:37,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:37,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:37,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:37,701 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2021-10-11 00:27:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:37,741 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2021-10-11 00:27:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:37,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-10-11 00:27:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:37,744 INFO L225 Difference]: With dead ends: 271 [2021-10-11 00:27:37,744 INFO L226 Difference]: Without dead ends: 191 [2021-10-11 00:27:37,745 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 [2021-10-11 00:27:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-10-11 00:27:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2021-10-11 00:27:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-10-11 00:27:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2021-10-11 00:27:37,761 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2021-10-11 00:27:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:37,761 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2021-10-11 00:27:37,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2021-10-11 00:27:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 00:27:37,764 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:37,764 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] [2021-10-11 00:27:37,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:27:37,765 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2021-10-11 00:27:37,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:37,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593026468] [2021-10-11 00:27:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:37,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593026468] [2021-10-11 00:27:37,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:37,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:27:37,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370165678] [2021-10-11 00:27:37,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:27:37,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:37,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:27:37,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:27:37,873 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 6 states. [2021-10-11 00:27:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:37,985 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2021-10-11 00:27:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:27:37,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2021-10-11 00:27:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:37,988 INFO L225 Difference]: With dead ends: 444 [2021-10-11 00:27:37,988 INFO L226 Difference]: Without dead ends: 261 [2021-10-11 00:27:37,989 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 [2021-10-11 00:27:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-11 00:27:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2021-10-11 00:27:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2021-10-11 00:27:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2021-10-11 00:27:38,004 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2021-10-11 00:27:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:38,005 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2021-10-11 00:27:38,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:27:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2021-10-11 00:27:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 00:27:38,007 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:38,007 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] [2021-10-11 00:27:38,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:27:38,008 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2021-10-11 00:27:38,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:38,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200842553] [2021-10-11 00:27:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:38,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200842553] [2021-10-11 00:27:38,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:38,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:38,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816030549] [2021-10-11 00:27:38,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:38,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:38,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:38,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:38,127 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand 3 states. [2021-10-11 00:27:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:38,192 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2021-10-11 00:27:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:38,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-10-11 00:27:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:38,195 INFO L225 Difference]: With dead ends: 408 [2021-10-11 00:27:38,196 INFO L226 Difference]: Without dead ends: 271 [2021-10-11 00:27:38,197 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 [2021-10-11 00:27:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-11 00:27:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2021-10-11 00:27:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2021-10-11 00:27:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2021-10-11 00:27:38,222 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2021-10-11 00:27:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:38,223 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2021-10-11 00:27:38,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2021-10-11 00:27:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-11 00:27:38,231 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:38,231 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] [2021-10-11 00:27:38,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:27:38,232 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2021-10-11 00:27:38,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:38,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713579758] [2021-10-11 00:27:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:38,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713579758] [2021-10-11 00:27:38,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:38,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:27:38,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65021523] [2021-10-11 00:27:38,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:27:38,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:27:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:38,320 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand 5 states. [2021-10-11 00:27:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:38,401 INFO L93 Difference]: Finished difference Result 622 states and 975 transitions. [2021-10-11 00:27:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:27:38,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-10-11 00:27:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:38,405 INFO L225 Difference]: With dead ends: 622 [2021-10-11 00:27:38,405 INFO L226 Difference]: Without dead ends: 427 [2021-10-11 00:27:38,406 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 [2021-10-11 00:27:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-10-11 00:27:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 280. [2021-10-11 00:27:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2021-10-11 00:27:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2021-10-11 00:27:38,421 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2021-10-11 00:27:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:38,422 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2021-10-11 00:27:38,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:27:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2021-10-11 00:27:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-11 00:27:38,423 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:38,423 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] [2021-10-11 00:27:38,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:27:38,424 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:38,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2021-10-11 00:27:38,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:38,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070481856] [2021-10-11 00:27:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:38,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070481856] [2021-10-11 00:27:38,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:38,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:38,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999433030] [2021-10-11 00:27:38,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:38,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:38,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:38,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:38,457 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand 3 states. [2021-10-11 00:27:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:38,507 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2021-10-11 00:27:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:38,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-10-11 00:27:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:38,510 INFO L225 Difference]: With dead ends: 563 [2021-10-11 00:27:38,510 INFO L226 Difference]: Without dead ends: 332 [2021-10-11 00:27:38,511 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 [2021-10-11 00:27:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-10-11 00:27:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2021-10-11 00:27:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2021-10-11 00:27:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2021-10-11 00:27:38,526 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2021-10-11 00:27:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:38,526 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2021-10-11 00:27:38,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2021-10-11 00:27:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-11 00:27:38,528 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:38,528 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] [2021-10-11 00:27:38,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:27:38,529 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:38,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:38,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2021-10-11 00:27:38,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:38,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886773812] [2021-10-11 00:27:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:38,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886773812] [2021-10-11 00:27:38,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:38,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:38,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462584329] [2021-10-11 00:27:38,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:38,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:38,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:38,562 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand 3 states. [2021-10-11 00:27:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:38,597 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2021-10-11 00:27:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:38,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-10-11 00:27:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:38,600 INFO L225 Difference]: With dead ends: 567 [2021-10-11 00:27:38,601 INFO L226 Difference]: Without dead ends: 284 [2021-10-11 00:27:38,601 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 [2021-10-11 00:27:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-11 00:27:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-10-11 00:27:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2021-10-11 00:27:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2021-10-11 00:27:38,616 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2021-10-11 00:27:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:38,617 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2021-10-11 00:27:38,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2021-10-11 00:27:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-11 00:27:38,618 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:38,619 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] [2021-10-11 00:27:38,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:27:38,619 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2021-10-11 00:27:38,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:38,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879607246] [2021-10-11 00:27:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:38,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879607246] [2021-10-11 00:27:38,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:38,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:27:38,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733377484] [2021-10-11 00:27:38,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:27:38,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:38,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:27:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:27:38,673 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2021-10-11 00:27:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:38,726 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2021-10-11 00:27:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:27:38,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-10-11 00:27:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:38,730 INFO L225 Difference]: With dead ends: 811 [2021-10-11 00:27:38,731 INFO L226 Difference]: Without dead ends: 580 [2021-10-11 00:27:38,732 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 [2021-10-11 00:27:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-11 00:27:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2021-10-11 00:27:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2021-10-11 00:27:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2021-10-11 00:27:38,773 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2021-10-11 00:27:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:38,773 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2021-10-11 00:27:38,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:27:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2021-10-11 00:27:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-11 00:27:38,775 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:38,775 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] [2021-10-11 00:27:38,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:27:38,776 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2021-10-11 00:27:38,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:38,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660015856] [2021-10-11 00:27:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:38,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660015856] [2021-10-11 00:27:38,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:38,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:27:38,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948306153] [2021-10-11 00:27:38,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:27:38,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:38,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:27:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:38,845 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand 5 states. [2021-10-11 00:27:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:38,917 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2021-10-11 00:27:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:27:38,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2021-10-11 00:27:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:38,922 INFO L225 Difference]: With dead ends: 1097 [2021-10-11 00:27:38,922 INFO L226 Difference]: Without dead ends: 574 [2021-10-11 00:27:38,923 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 [2021-10-11 00:27:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-10-11 00:27:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2021-10-11 00:27:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2021-10-11 00:27:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2021-10-11 00:27:38,960 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2021-10-11 00:27:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:38,960 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2021-10-11 00:27:38,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:27:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2021-10-11 00:27:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-11 00:27:38,962 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:38,962 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] [2021-10-11 00:27:38,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:27:38,963 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:38,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2021-10-11 00:27:38,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:38,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281802415] [2021-10-11 00:27:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:38,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281802415] [2021-10-11 00:27:38,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:38,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:38,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978284282] [2021-10-11 00:27:38,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:38,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:38,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:38,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:38,999 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand 3 states. [2021-10-11 00:27:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:39,078 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2021-10-11 00:27:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:39,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-10-11 00:27:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:39,085 INFO L225 Difference]: With dead ends: 1592 [2021-10-11 00:27:39,085 INFO L226 Difference]: Without dead ends: 1069 [2021-10-11 00:27:39,087 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 [2021-10-11 00:27:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-10-11 00:27:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2021-10-11 00:27:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2021-10-11 00:27:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2021-10-11 00:27:39,128 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2021-10-11 00:27:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:39,129 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2021-10-11 00:27:39,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2021-10-11 00:27:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-11 00:27:39,130 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:39,130 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] [2021-10-11 00:27:39,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:27:39,131 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:39,131 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2021-10-11 00:27:39,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:39,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774977667] [2021-10-11 00:27:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:39,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774977667] [2021-10-11 00:27:39,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:39,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:27:39,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367947951] [2021-10-11 00:27:39,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:27:39,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:27:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:39,191 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand 5 states. [2021-10-11 00:27:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:39,275 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2021-10-11 00:27:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:27:39,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2021-10-11 00:27:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:39,280 INFO L225 Difference]: With dead ends: 1105 [2021-10-11 00:27:39,280 INFO L226 Difference]: Without dead ends: 570 [2021-10-11 00:27:39,281 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 [2021-10-11 00:27:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-11 00:27:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-10-11 00:27:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2021-10-11 00:27:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2021-10-11 00:27:39,355 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2021-10-11 00:27:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:39,355 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2021-10-11 00:27:39,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:27:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2021-10-11 00:27:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-11 00:27:39,357 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:39,358 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] [2021-10-11 00:27:39,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:27:39,358 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:39,359 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2021-10-11 00:27:39,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:39,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896949815] [2021-10-11 00:27:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:39,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896949815] [2021-10-11 00:27:39,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:39,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:39,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599161843] [2021-10-11 00:27:39,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:39,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:39,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:39,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:39,410 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand 3 states. [2021-10-11 00:27:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:39,520 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2021-10-11 00:27:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:39,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-10-11 00:27:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:39,529 INFO L225 Difference]: With dead ends: 1592 [2021-10-11 00:27:39,529 INFO L226 Difference]: Without dead ends: 1073 [2021-10-11 00:27:39,531 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 [2021-10-11 00:27:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-10-11 00:27:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2021-10-11 00:27:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2021-10-11 00:27:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2021-10-11 00:27:39,594 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2021-10-11 00:27:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:39,595 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2021-10-11 00:27:39,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2021-10-11 00:27:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-11 00:27:39,597 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:39,597 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] [2021-10-11 00:27:39,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:27:39,598 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:39,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2021-10-11 00:27:39,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:39,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605040358] [2021-10-11 00:27:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:39,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605040358] [2021-10-11 00:27:39,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:39,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:39,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119034747] [2021-10-11 00:27:39,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:39,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:39,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:39,642 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand 3 states. [2021-10-11 00:27:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:39,731 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2021-10-11 00:27:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:39,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-10-11 00:27:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:39,738 INFO L225 Difference]: With dead ends: 1311 [2021-10-11 00:27:39,738 INFO L226 Difference]: Without dead ends: 784 [2021-10-11 00:27:39,739 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 [2021-10-11 00:27:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-10-11 00:27:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2021-10-11 00:27:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2021-10-11 00:27:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2021-10-11 00:27:39,808 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2021-10-11 00:27:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:39,809 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2021-10-11 00:27:39,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2021-10-11 00:27:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-11 00:27:39,811 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:39,811 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] [2021-10-11 00:27:39,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:27:39,812 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2021-10-11 00:27:39,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:39,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715699045] [2021-10-11 00:27:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:39,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715699045] [2021-10-11 00:27:39,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965380133] [2021-10-11 00:27:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:27:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:40,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:27:40,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:27:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:40,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-11 00:27:40,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-11 00:27:40,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019730841] [2021-10-11 00:27:40,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:40,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:40,168 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand 3 states. [2021-10-11 00:27:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:40,282 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2021-10-11 00:27:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:40,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-10-11 00:27:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:40,288 INFO L225 Difference]: With dead ends: 1341 [2021-10-11 00:27:40,288 INFO L226 Difference]: Without dead ends: 686 [2021-10-11 00:27:40,293 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 [2021-10-11 00:27:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-11 00:27:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-10-11 00:27:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2021-10-11 00:27:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2021-10-11 00:27:40,354 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2021-10-11 00:27:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:40,354 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2021-10-11 00:27:40,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2021-10-11 00:27:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-11 00:27:40,356 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:40,356 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:27:40,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-11 00:27:40,582 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2021-10-11 00:27:40,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:40,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135172257] [2021-10-11 00:27:40,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:40,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135172257] [2021-10-11 00:27:40,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691535592] [2021-10-11 00:27:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:27:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:40,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:27:40,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:27:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:40,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-11 00:27:40,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-11 00:27:40,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458112125] [2021-10-11 00:27:40,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:40,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:40,950 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand 3 states. [2021-10-11 00:27:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:41,092 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2021-10-11 00:27:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:41,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-10-11 00:27:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:41,102 INFO L225 Difference]: With dead ends: 2025 [2021-10-11 00:27:41,102 INFO L226 Difference]: Without dead ends: 1364 [2021-10-11 00:27:41,104 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 [2021-10-11 00:27:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-10-11 00:27:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2021-10-11 00:27:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2021-10-11 00:27:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2021-10-11 00:27:41,235 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2021-10-11 00:27:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:41,236 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2021-10-11 00:27:41,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2021-10-11 00:27:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-11 00:27:41,238 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:41,238 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] [2021-10-11 00:27:41,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-11 00:27:41,466 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2021-10-11 00:27:41,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:41,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92495923] [2021-10-11 00:27:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:41,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92495923] [2021-10-11 00:27:41,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:41,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:41,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364090949] [2021-10-11 00:27:41,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:41,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:41,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:41,538 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand 3 states. [2021-10-11 00:27:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:41,726 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2021-10-11 00:27:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:41,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-10-11 00:27:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:41,738 INFO L225 Difference]: With dead ends: 2736 [2021-10-11 00:27:41,738 INFO L226 Difference]: Without dead ends: 1463 [2021-10-11 00:27:41,741 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 [2021-10-11 00:27:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-10-11 00:27:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2021-10-11 00:27:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2021-10-11 00:27:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2021-10-11 00:27:41,890 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2021-10-11 00:27:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:41,890 INFO L481 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2021-10-11 00:27:41,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2021-10-11 00:27:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-11 00:27:41,893 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:41,894 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] [2021-10-11 00:27:41,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 00:27:41,894 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2021-10-11 00:27:41,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:41,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109680557] [2021-10-11 00:27:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:41,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109680557] [2021-10-11 00:27:41,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:41,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:41,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108189946] [2021-10-11 00:27:41,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:41,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:41,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:41,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:41,944 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand 3 states. [2021-10-11 00:27:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:42,083 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2021-10-11 00:27:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:42,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-10-11 00:27:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:42,091 INFO L225 Difference]: With dead ends: 2354 [2021-10-11 00:27:42,091 INFO L226 Difference]: Without dead ends: 973 [2021-10-11 00:27:42,093 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 [2021-10-11 00:27:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-10-11 00:27:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2021-10-11 00:27:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2021-10-11 00:27:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2021-10-11 00:27:42,177 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2021-10-11 00:27:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:42,178 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2021-10-11 00:27:42,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2021-10-11 00:27:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-11 00:27:42,180 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:42,180 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] [2021-10-11 00:27:42,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 00:27:42,181 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2021-10-11 00:27:42,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:42,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602880539] [2021-10-11 00:27:42,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:42,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602880539] [2021-10-11 00:27:42,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:42,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:27:42,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382590571] [2021-10-11 00:27:42,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:27:42,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:42,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:27:42,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:27:42,248 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand 4 states. [2021-10-11 00:27:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:42,298 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2021-10-11 00:27:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:27:42,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-10-11 00:27:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:42,302 INFO L225 Difference]: With dead ends: 1258 [2021-10-11 00:27:42,302 INFO L226 Difference]: Without dead ends: 373 [2021-10-11 00:27:42,304 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 [2021-10-11 00:27:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-10-11 00:27:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2021-10-11 00:27:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2021-10-11 00:27:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2021-10-11 00:27:42,340 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2021-10-11 00:27:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:42,340 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2021-10-11 00:27:42,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:27:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2021-10-11 00:27:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-11 00:27:42,342 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:42,343 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] [2021-10-11 00:27:42,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 00:27:42,343 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2021-10-11 00:27:42,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:42,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764836304] [2021-10-11 00:27:42,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:42,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764836304] [2021-10-11 00:27:42,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424734887] [2021-10-11 00:27:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:27:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:42,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:27:42,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:27:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:42,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-11 00:27:42,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-11 00:27:42,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210281199] [2021-10-11 00:27:42,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:42,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:42,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:42,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:42,654 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand 3 states. [2021-10-11 00:27:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:42,741 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2021-10-11 00:27:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:42,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-10-11 00:27:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:42,746 INFO L225 Difference]: With dead ends: 1059 [2021-10-11 00:27:42,747 INFO L226 Difference]: Without dead ends: 732 [2021-10-11 00:27:42,748 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 [2021-10-11 00:27:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-11 00:27:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2021-10-11 00:27:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2021-10-11 00:27:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2021-10-11 00:27:42,808 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2021-10-11 00:27:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:42,809 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2021-10-11 00:27:42,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2021-10-11 00:27:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-11 00:27:42,811 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:42,812 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] [2021-10-11 00:27:43,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-11 00:27:43,038 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2021-10-11 00:27:43,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:43,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913067976] [2021-10-11 00:27:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:43,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913067976] [2021-10-11 00:27:43,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:43,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:43,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184662837] [2021-10-11 00:27:43,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:43,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:43,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:43,077 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand 3 states. [2021-10-11 00:27:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:43,163 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2021-10-11 00:27:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:43,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-10-11 00:27:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:43,169 INFO L225 Difference]: With dead ends: 1382 [2021-10-11 00:27:43,169 INFO L226 Difference]: Without dead ends: 811 [2021-10-11 00:27:43,171 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 [2021-10-11 00:27:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-10-11 00:27:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2021-10-11 00:27:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2021-10-11 00:27:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2021-10-11 00:27:43,253 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2021-10-11 00:27:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:43,253 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2021-10-11 00:27:43,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2021-10-11 00:27:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-11 00:27:43,256 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:43,256 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:27:43,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 00:27:43,256 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2021-10-11 00:27:43,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:43,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741609027] [2021-10-11 00:27:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:43,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741609027] [2021-10-11 00:27:43,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:43,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:27:43,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336462374] [2021-10-11 00:27:43,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:43,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:43,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:43,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:27:43,291 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand 3 states. [2021-10-11 00:27:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:43,361 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2021-10-11 00:27:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:43,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-10-11 00:27:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:43,366 INFO L225 Difference]: With dead ends: 1208 [2021-10-11 00:27:43,366 INFO L226 Difference]: Without dead ends: 551 [2021-10-11 00:27:43,367 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 [2021-10-11 00:27:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-10-11 00:27:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2021-10-11 00:27:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2021-10-11 00:27:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2021-10-11 00:27:43,412 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2021-10-11 00:27:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:43,413 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2021-10-11 00:27:43,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2021-10-11 00:27:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-11 00:27:43,415 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:43,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, 1, 1] [2021-10-11 00:27:43,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-11 00:27:43,415 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2021-10-11 00:27:43,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:43,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539684275] [2021-10-11 00:27:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:43,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539684275] [2021-10-11 00:27:43,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:43,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:27:43,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496508926] [2021-10-11 00:27:43,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:27:43,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:27:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:27:43,475 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand 4 states. [2021-10-11 00:27:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:43,526 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2021-10-11 00:27:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:27:43,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-10-11 00:27:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:43,529 INFO L225 Difference]: With dead ends: 820 [2021-10-11 00:27:43,530 INFO L226 Difference]: Without dead ends: 427 [2021-10-11 00:27:43,531 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 [2021-10-11 00:27:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-10-11 00:27:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-10-11 00:27:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2021-10-11 00:27:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2021-10-11 00:27:43,568 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2021-10-11 00:27:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:43,568 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2021-10-11 00:27:43,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:27:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2021-10-11 00:27:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-11 00:27:43,571 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:43,571 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] [2021-10-11 00:27:43,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-11 00:27:43,571 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2021-10-11 00:27:43,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:43,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357265563] [2021-10-11 00:27:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:43,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357265563] [2021-10-11 00:27:43,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050719212] [2021-10-11 00:27:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:27:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:43,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:27:43,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:27:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:27:43,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-11 00:27:43,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-11 00:27:43,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455279339] [2021-10-11 00:27:43,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:27:43,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:27:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:43,888 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand 3 states. [2021-10-11 00:27:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:44,006 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2021-10-11 00:27:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:27:44,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-10-11 00:27:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:44,012 INFO L225 Difference]: With dead ends: 1163 [2021-10-11 00:27:44,013 INFO L226 Difference]: Without dead ends: 822 [2021-10-11 00:27:44,014 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 [2021-10-11 00:27:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-10-11 00:27:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2021-10-11 00:27:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2021-10-11 00:27:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2021-10-11 00:27:44,105 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2021-10-11 00:27:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:44,106 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2021-10-11 00:27:44,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:27:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2021-10-11 00:27:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-11 00:27:44,109 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:44,110 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] [2021-10-11 00:27:44,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:27:44,338 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2021-10-11 00:27:44,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:44,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338302450] [2021-10-11 00:27:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:44,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338302450] [2021-10-11 00:27:44,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788782209] [2021-10-11 00:27:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:27:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:44,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-11 00:27:44,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:27:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:44,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-11 00:27:44,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-10-11 00:27:44,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946672919] [2021-10-11 00:27:44,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:27:44,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:27:44,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:44,690 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand 4 states. [2021-10-11 00:27:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:44,848 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2021-10-11 00:27:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:27:44,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-10-11 00:27:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:44,856 INFO L225 Difference]: With dead ends: 1704 [2021-10-11 00:27:44,856 INFO L226 Difference]: Without dead ends: 1054 [2021-10-11 00:27:44,858 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 [2021-10-11 00:27:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-10-11 00:27:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2021-10-11 00:27:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2021-10-11 00:27:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2021-10-11 00:27:44,965 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2021-10-11 00:27:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:44,965 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2021-10-11 00:27:44,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:27:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2021-10-11 00:27:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-11 00:27:44,968 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:44,968 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] [2021-10-11 00:27:45,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-11 00:27:45,182 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:45,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:45,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2021-10-11 00:27:45,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:45,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482481587] [2021-10-11 00:27:45,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:45,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482481587] [2021-10-11 00:27:45,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:45,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:27:45,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704949926] [2021-10-11 00:27:45,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:27:45,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:45,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:27:45,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:27:45,253 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand 4 states. [2021-10-11 00:27:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:45,434 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2021-10-11 00:27:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:27:45,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-10-11 00:27:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:45,447 INFO L225 Difference]: With dead ends: 2540 [2021-10-11 00:27:45,447 INFO L226 Difference]: Without dead ends: 1698 [2021-10-11 00:27:45,450 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 [2021-10-11 00:27:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2021-10-11 00:27:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2021-10-11 00:27:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2021-10-11 00:27:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2021-10-11 00:27:45,561 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2021-10-11 00:27:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:45,562 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2021-10-11 00:27:45,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:27:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2021-10-11 00:27:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-11 00:27:45,564 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:27:45,564 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] [2021-10-11 00:27:45,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-11 00:27:45,565 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:27:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:27:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2021-10-11 00:27:45,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:27:45,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680952090] [2021-10-11 00:27:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:27:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:27:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:27:45,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680952090] [2021-10-11 00:27:45,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:27:45,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:27:45,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777748960] [2021-10-11 00:27:45,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:27:45,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:27:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:27:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:27:45,642 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand 5 states. [2021-10-11 00:27:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:27:45,732 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2021-10-11 00:27:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:27:45,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-10-11 00:27:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:27:45,733 INFO L225 Difference]: With dead ends: 1285 [2021-10-11 00:27:45,733 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 00:27:45,735 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 [2021-10-11 00:27:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 00:27:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 00:27:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 00:27:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:27:45,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-10-11 00:27:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:27:45,737 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:27:45,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:27:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:27:45,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 00:27:45,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-11 00:27:45,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 00:27:46,662 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-10-11 00:27:46,862 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-10-11 00:27:47,085 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2021-10-11 00:27:47,361 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-10-11 00:27:47,621 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-10-11 00:27:47,871 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-10-11 00:27:48,125 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-10-11 00:27:48,296 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-10-11 00:27:48,674 WARN L197 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2021-10-11 00:27:48,874 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-10-11 00:27:49,142 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-10-11 00:27:49,380 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-10-11 00:27:49,515 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2021-10-11 00:27:49,649 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-10-11 00:27:49,800 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-10-11 00:27:49,922 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-10-11 00:27:50,208 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-10-11 00:27:50,423 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2021-10-11 00:27:50,540 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-10-11 00:27:50,742 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-10-11 00:27:51,060 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2021-10-11 00:27:51,244 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-10-11 00:27:51,461 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-10-11 00:27:51,670 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-10-11 00:27:51,821 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-10-11 00:27:51,982 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-10-11 00:27:51,987 INFO L262 CegarLoopResult]: For program point L399(lines 399 404) no Hoare annotation was computed. [2021-10-11 00:27:51,988 INFO L258 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))) [2021-10-11 00:27:51,988 INFO L258 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))) [2021-10-11 00:27:51,988 INFO L258 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)) [2021-10-11 00:27:51,989 INFO L258 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))) [2021-10-11 00:27:51,989 INFO L258 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)) [2021-10-11 00:27:51,990 INFO L258 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))) [2021-10-11 00:27:51,990 INFO L258 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)) [2021-10-11 00:27:51,990 INFO L262 CegarLoopResult]: For program point L103(lines 103 118) no Hoare annotation was computed. [2021-10-11 00:27:51,990 INFO L262 CegarLoopResult]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2021-10-11 00:27:51,991 INFO L262 CegarLoopResult]: For program point L71(lines 43 93) no Hoare annotation was computed. [2021-10-11 00:27:51,991 INFO L265 CegarLoopResult]: At program point L501(lines 485 503) the Hoare annotation is: true [2021-10-11 00:27:51,991 INFO L258 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)) [2021-10-11 00:27:51,991 INFO L262 CegarLoopResult]: For program point L204(lines 204 210) no Hoare annotation was computed. [2021-10-11 00:27:51,991 INFO L258 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)) [2021-10-11 00:27:51,991 INFO L262 CegarLoopResult]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2021-10-11 00:27:51,991 INFO L258 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)) [2021-10-11 00:27:51,992 INFO L262 CegarLoopResult]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-10-11 00:27:51,992 INFO L262 CegarLoopResult]: For program point L107(lines 107 117) no Hoare annotation was computed. [2021-10-11 00:27:51,992 INFO L262 CegarLoopResult]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2021-10-11 00:27:51,992 INFO L262 CegarLoopResult]: For program point L174(lines 174 179) no Hoare annotation was computed. [2021-10-11 00:27:51,992 INFO L262 CegarLoopResult]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2021-10-11 00:27:51,992 INFO L262 CegarLoopResult]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2021-10-11 00:27:51,992 INFO L262 CegarLoopResult]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2021-10-11 00:27:51,992 INFO L258 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)) [2021-10-11 00:27:51,992 INFO L258 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)) [2021-10-11 00:27:51,993 INFO L262 CegarLoopResult]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-10-11 00:27:51,993 INFO L262 CegarLoopResult]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2021-10-11 00:27:51,993 INFO L262 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2021-10-11 00:27:51,993 INFO L262 CegarLoopResult]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-10-11 00:27:51,993 INFO L262 CegarLoopResult]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-10-11 00:27:51,993 INFO L262 CegarLoopResult]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-10-11 00:27:51,994 INFO L262 CegarLoopResult]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2021-10-11 00:27:51,994 INFO L262 CegarLoopResult]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-10-11 00:27:51,994 INFO L262 CegarLoopResult]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-11 00:27:51,994 INFO L262 CegarLoopResult]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2021-10-11 00:27:51,994 INFO L262 CegarLoopResult]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2021-10-11 00:27:51,995 INFO L258 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))) [2021-10-11 00:27:51,995 INFO L258 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)) [2021-10-11 00:27:51,995 INFO L262 CegarLoopResult]: For program point L278(line 278) no Hoare annotation was computed. [2021-10-11 00:27:51,995 INFO L262 CegarLoopResult]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:51,995 INFO L262 CegarLoopResult]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:51,995 INFO L262 CegarLoopResult]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2021-10-11 00:27:51,995 INFO L262 CegarLoopResult]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:51,996 INFO L258 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))) [2021-10-11 00:27:51,996 INFO L262 CegarLoopResult]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:51,996 INFO L262 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-10-11 00:27:51,996 INFO L262 CegarLoopResult]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2021-10-11 00:27:51,996 INFO L258 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))) [2021-10-11 00:27:51,996 INFO L262 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2021-10-11 00:27:51,996 INFO L262 CegarLoopResult]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2021-10-11 00:27:51,996 INFO L262 CegarLoopResult]: For program point L382(lines 382 386) no Hoare annotation was computed. [2021-10-11 00:27:51,997 INFO L258 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))) [2021-10-11 00:27:51,997 INFO L262 CegarLoopResult]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2021-10-11 00:27:51,997 INFO L258 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))) [2021-10-11 00:27:51,998 INFO L258 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)) [2021-10-11 00:27:51,998 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 00:27:51,998 INFO L258 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))) [2021-10-11 00:27:51,998 INFO L258 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))) [2021-10-11 00:27:51,998 INFO L262 CegarLoopResult]: For program point L53(lines 43 93) no Hoare annotation was computed. [2021-10-11 00:27:51,998 INFO L262 CegarLoopResult]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:51,998 INFO L262 CegarLoopResult]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:51,998 INFO L262 CegarLoopResult]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:51,999 INFO L262 CegarLoopResult]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:51,999 INFO L262 CegarLoopResult]: For program point L54(lines 54 58) no Hoare annotation was computed. [2021-10-11 00:27:51,999 INFO L258 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))) [2021-10-11 00:27:51,999 INFO L258 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))) [2021-10-11 00:27:51,999 INFO L258 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))) [2021-10-11 00:27:51,999 INFO L258 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))) [2021-10-11 00:27:52,000 INFO L258 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))) [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L189(lines 189 194) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:52,000 INFO L262 CegarLoopResult]: For program point L291(lines 291 298) no Hoare annotation was computed. [2021-10-11 00:27:52,001 INFO L258 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))) [2021-10-11 00:27:52,001 INFO L258 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))) [2021-10-11 00:27:52,001 INFO L262 CegarLoopResult]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-11 00:27:52,001 INFO L262 CegarLoopResult]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-11 00:27:52,001 INFO L262 CegarLoopResult]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-11 00:27:52,001 INFO L262 CegarLoopResult]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-11 00:27:52,001 INFO L258 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)) [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L260(lines 260 265) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L129(lines 129 134) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2021-10-11 00:27:52,002 INFO L265 CegarLoopResult]: At program point L493(lines 493 499) the Hoare annotation is: true [2021-10-11 00:27:52,002 INFO L262 CegarLoopResult]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:52,003 INFO L262 CegarLoopResult]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:52,003 INFO L262 CegarLoopResult]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2021-10-11 00:27:52,003 INFO L262 CegarLoopResult]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2021-10-11 00:27:52,003 INFO L262 CegarLoopResult]: For program point L65(lines 65 69) no Hoare annotation was computed. [2021-10-11 00:27:52,003 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-11 00:27:52,003 INFO L262 CegarLoopResult]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2021-10-11 00:27:52,004 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-10-11 00:27:52,004 INFO L262 CegarLoopResult]: For program point L99(lines 99 119) no Hoare annotation was computed. [2021-10-11 00:27:52,004 INFO L262 CegarLoopResult]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2021-10-11 00:27:52,004 INFO L258 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))) [2021-10-11 00:27:52,004 INFO L258 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))) [2021-10-11 00:27:52,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:27:52 BoogieIcfgContainer [2021-10-11 00:27:52,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:27:52,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:27:52,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:27:52,097 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:27:52,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:27:36" (3/4) ... [2021-10-11 00:27:52,101 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 00:27:52,120 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-11 00:27:52,121 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 00:27:52,122 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:27:52,123 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:27:52,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2021-10-11 00:27:52,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) [2021-10-11 00:27:52,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2021-10-11 00:27:52,254 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c92de09-127a-45c0-9a70-225b9b2199fb/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:27:52,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:27:52,256 INFO L168 Benchmark]: Toolchain (without parser) took 17528.40 ms. Allocated memory was 88.1 MB in the beginning and 402.7 MB in the end (delta: 314.6 MB). Free memory was 58.0 MB in the beginning and 160.2 MB in the end (delta: -102.2 MB). Peak memory consumption was 212.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:27:52,256 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 88.1 MB. Free memory is still 45.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:27:52,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.35 ms. Allocated memory is still 88.1 MB. Free memory was 57.8 MB in the beginning and 62.0 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:27:52,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.84 ms. Allocated memory is still 88.1 MB. Free memory was 62.0 MB in the beginning and 59.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:27:52,258 INFO L168 Benchmark]: Boogie Preprocessor took 39.58 ms. Allocated memory is still 88.1 MB. Free memory was 59.5 MB in the beginning and 57.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:27:52,258 INFO L168 Benchmark]: RCFGBuilder took 999.38 ms. Allocated memory was 88.1 MB in the beginning and 113.2 MB in the end (delta: 25.2 MB). Free memory was 57.7 MB in the beginning and 71.9 MB in the end (delta: -14.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 16.1 GB. [2021-10-11 00:27:52,259 INFO L168 Benchmark]: TraceAbstraction took 15870.03 ms. Allocated memory was 113.2 MB in the beginning and 402.7 MB in the end (delta: 289.4 MB). Free memory was 71.4 MB in the beginning and 169.7 MB in the end (delta: -98.3 MB). Peak memory consumption was 226.8 MB. Max. memory is 16.1 GB. [2021-10-11 00:27:52,259 INFO L168 Benchmark]: Witness Printer took 158.54 ms. Allocated memory is still 402.7 MB. Free memory was 169.7 MB in the beginning and 160.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:27:52,263 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.95 ms. Allocated memory is still 88.1 MB. Free memory is still 45.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 390.35 ms. Allocated memory is still 88.1 MB. Free memory was 57.8 MB in the beginning and 62.0 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.84 ms. Allocated memory is still 88.1 MB. Free memory was 62.0 MB in the beginning and 59.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.58 ms. Allocated memory is still 88.1 MB. Free memory was 59.5 MB in the beginning and 57.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 999.38 ms. Allocated memory was 88.1 MB in the beginning and 113.2 MB in the end (delta: 25.2 MB). Free memory was 57.7 MB in the beginning and 71.9 MB in the end (delta: -14.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15870.03 ms. Allocated memory was 113.2 MB in the beginning and 402.7 MB in the end (delta: 289.4 MB). Free memory was 71.4 MB in the beginning and 169.7 MB in the end (delta: -98.3 MB). Peak memory consumption was 226.8 MB. Max. memory is 16.1 GB. * Witness Printer took 158.54 ms. Allocated memory is still 402.7 MB. Free memory was 169.7 MB in the beginning and 160.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && d1_val_t == b0_val_t) && 2 <= b1_ev) && b0_val_t == 1) && 2 <= d0_ev) && b0_val == 0) && 1 == b1_req_up) && b1_val_t == b0_val_t) && d0_req_up == 1) && 0 == z_val_t) && d0_val_t == b0_val_t) && b0_req_up == 1) && 2 <= d1_ev - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((2 <= b0_ev && !(b1_val_t == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && !(1 == b1_req_up)) && z_val == 0) && !(b1_val == 0)) && 0 == z_val_t) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && b0_ev == 0) && 1 == b1_req_up) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.4s, OverallIterations: 29, TraceHistogramMax: 2, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4787 SDtfs, 2771 SDslu, 4972 SDs, 0 SdLazy, 398 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s 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.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 2015 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3750 HoareAnnotationTreeSize, 33 FomulaSimplifications, 39368 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 33 FomulaSimplificationsInter, 14097 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 458837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...