./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 23:10:42,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 23:10:42,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 23:10:42,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 23:10:42,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 23:10:42,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 23:10:42,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 23:10:42,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 23:10:42,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 23:10:42,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 23:10:42,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 23:10:42,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 23:10:42,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 23:10:42,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 23:10:42,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 23:10:42,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 23:10:42,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 23:10:42,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 23:10:42,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 23:10:42,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 23:10:42,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 23:10:42,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 23:10:42,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 23:10:42,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 23:10:42,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 23:10:42,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 23:10:42,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 23:10:42,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 23:10:42,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 23:10:42,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 23:10:42,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 23:10:42,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 23:10:42,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 23:10:42,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 23:10:42,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 23:10:42,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 23:10:42,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 23:10:42,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 23:10:42,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 23:10:42,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 23:10:42,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 23:10:42,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-22 23:10:42,630 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 23:10:42,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 23:10:42,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-22 23:10:42,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-22 23:10:42,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 23:10:42,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 23:10:42,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 23:10:42,634 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 23:10:42,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 23:10:42,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 23:10:42,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 23:10:42,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 23:10:42,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 23:10:42,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 23:10:42,643 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 23:10:42,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 23:10:42,643 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 23:10:42,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 23:10:42,644 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-22 23:10:42,644 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-22 23:10:42,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 23:10:42,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:10:42,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 23:10:42,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 23:10:42,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 23:10:42,646 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-22 23:10:42,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 23:10:42,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 23:10:42,646 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_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/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_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ 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 -> Kojak 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2021-11-22 23:10:42,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 23:10:42,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 23:10:42,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 23:10:42,988 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 23:10:42,989 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 23:10:42,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-11-22 23:10:43,063 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/data/2de5f8af6/263769196ad74ad2a1f4c1514d416687/FLAG360a2e159 [2021-11-22 23:10:43,641 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 23:10:43,642 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-11-22 23:10:43,660 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/data/2de5f8af6/263769196ad74ad2a1f4c1514d416687/FLAG360a2e159 [2021-11-22 23:10:43,931 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/data/2de5f8af6/263769196ad74ad2a1f4c1514d416687 [2021-11-22 23:10:43,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 23:10:43,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 23:10:43,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 23:10:43,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 23:10:43,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 23:10:43,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:10:43" (1/1) ... [2021-11-22 23:10:43,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d1d488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:43, skipping insertion in model container [2021-11-22 23:10:43,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:10:43" (1/1) ... [2021-11-22 23:10:43,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 23:10:43,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 23:10:44,251 WARN L230 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_8db19613-eac4-4fef-85df-6eb3197ec875/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2021-11-22 23:10:44,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:10:44,264 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 23:10:44,325 WARN L230 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_8db19613-eac4-4fef-85df-6eb3197ec875/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2021-11-22 23:10:44,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:10:44,341 INFO L208 MainTranslator]: Completed translation [2021-11-22 23:10:44,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44 WrapperNode [2021-11-22 23:10:44,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 23:10:44,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 23:10:44,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 23:10:44,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 23:10:44,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,407 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2021-11-22 23:10:44,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 23:10:44,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 23:10:44,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 23:10:44,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 23:10:44,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 23:10:44,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 23:10:44,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 23:10:44,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 23:10:44,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:10:44" (1/1) ... [2021-11-22 23:10:44,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:10:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-22 23:10:44,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-22 23:10:44,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-22 23:10:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 23:10:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 23:10:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 23:10:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 23:10:44,702 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 23:10:44,704 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 23:10:45,358 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 23:10:45,958 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 23:10:45,958 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 23:10:45,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:10:45 BoogieIcfgContainer [2021-11-22 23:10:45,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 23:10:45,962 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-22 23:10:45,962 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-22 23:10:45,973 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-22 23:10:45,974 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:10:45" (1/1) ... [2021-11-22 23:10:45,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 23:10:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-22 23:10:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-22 23:10:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-22 23:10:46,036 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:46,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2021-11-22 23:10:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2021-11-22 23:10:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-22 23:10:46,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:46,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 24 states and 42 transitions. [2021-11-22 23:10:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2021-11-22 23:10:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-22 23:10:47,674 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:47,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 28 states and 52 transitions. [2021-11-22 23:10:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. [2021-11-22 23:10:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-22 23:10:48,441 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:48,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 33 states and 64 transitions. [2021-11-22 23:10:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 64 transitions. [2021-11-22 23:10:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 23:10:49,493 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:49,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 40 states and 78 transitions. [2021-11-22 23:10:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 78 transitions. [2021-11-22 23:10:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-22 23:10:50,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:50,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 46 states and 91 transitions. [2021-11-22 23:10:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 91 transitions. [2021-11-22 23:10:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-22 23:10:52,335 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:52,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 47 states and 91 transitions. [2021-11-22 23:10:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 91 transitions. [2021-11-22 23:10:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 23:10:52,643 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:52,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 57 states and 110 transitions. [2021-11-22 23:10:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 110 transitions. [2021-11-22 23:10:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 23:10:54,912 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:54,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 58 states and 111 transitions. [2021-11-22 23:10:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 111 transitions. [2021-11-22 23:10:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 23:10:55,087 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:55,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:10:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:10:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 61 states and 116 transitions. [2021-11-22 23:10:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 116 transitions. [2021-11-22 23:10:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 23:10:55,434 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:10:55,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:10:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:10:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 77 states and 151 transitions. [2021-11-22 23:11:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 151 transitions. [2021-11-22 23:11:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-22 23:11:00,514 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:00,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 89 states and 171 transitions. [2021-11-22 23:11:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 171 transitions. [2021-11-22 23:11:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-22 23:11:04,430 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:04,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 90 states and 172 transitions. [2021-11-22 23:11:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 172 transitions. [2021-11-22 23:11:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 23:11:04,939 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:04,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 107 states and 210 transitions. [2021-11-22 23:11:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 210 transitions. [2021-11-22 23:11:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 23:11:10,401 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:10,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 108 states and 212 transitions. [2021-11-22 23:11:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 212 transitions. [2021-11-22 23:11:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-22 23:11:10,942 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:10,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 109 states and 216 transitions. [2021-11-22 23:11:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 216 transitions. [2021-11-22 23:11:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 23:11:11,517 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:11,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 128 states and 260 transitions. [2021-11-22 23:11:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 260 transitions. [2021-11-22 23:11:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 23:11:19,451 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:19,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 129 states and 265 transitions. [2021-11-22 23:11:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 265 transitions. [2021-11-22 23:11:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 23:11:20,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:20,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 131 states and 268 transitions. [2021-11-22 23:11:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 268 transitions. [2021-11-22 23:11:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 23:11:21,293 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:21,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 132 states and 273 transitions. [2021-11-22 23:11:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 273 transitions. [2021-11-22 23:11:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:11:22,094 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:22,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 152 states and 320 transitions. [2021-11-22 23:11:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 320 transitions. [2021-11-22 23:11:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:11:32,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:32,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 154 states and 327 transitions. [2021-11-22 23:11:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 327 transitions. [2021-11-22 23:11:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:11:33,658 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:33,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 156 states and 330 transitions. [2021-11-22 23:11:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 330 transitions. [2021-11-22 23:11:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:11:34,909 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:34,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 158 states and 333 transitions. [2021-11-22 23:11:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 333 transitions. [2021-11-22 23:11:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 23:11:36,402 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:36,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 159 states and 339 transitions. [2021-11-22 23:11:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 339 transitions. [2021-11-22 23:11:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:11:37,341 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:37,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 178 states and 382 transitions. [2021-11-22 23:11:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 382 transitions. [2021-11-22 23:11:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:11:46,767 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:46,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 181 states and 392 transitions. [2021-11-22 23:11:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 392 transitions. [2021-11-22 23:11:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:11:49,027 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:49,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 182 states and 393 transitions. [2021-11-22 23:11:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 393 transitions. [2021-11-22 23:11:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:11:49,927 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:49,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 185 states and 402 transitions. [2021-11-22 23:11:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 402 transitions. [2021-11-22 23:11:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 23:11:51,849 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:51,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 186 states and 409 transitions. [2021-11-22 23:11:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 409 transitions. [2021-11-22 23:11:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:11:52,714 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:52,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:11:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:11:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 189 states and 418 transitions. [2021-11-22 23:11:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 418 transitions. [2021-11-22 23:11:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:11:57,350 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:11:57,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:11:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:11:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 193 states and 431 transitions. [2021-11-22 23:12:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 431 transitions. [2021-11-22 23:12:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:12:00,541 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:00,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 197 states and 443 transitions. [2021-11-22 23:12:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 443 transitions. [2021-11-22 23:12:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:12:03,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:03,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 198 states and 444 transitions. [2021-11-22 23:12:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 444 transitions. [2021-11-22 23:12:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:12:04,426 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:04,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 201 states and 454 transitions. [2021-11-22 23:12:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 454 transitions. [2021-11-22 23:12:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-22 23:12:06,395 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:06,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 202 states and 460 transitions. [2021-11-22 23:12:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 460 transitions. [2021-11-22 23:12:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:12:07,446 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:07,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 216 states and 524 transitions. [2021-11-22 23:12:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 524 transitions. [2021-11-22 23:12:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:12:17,286 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:17,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 220 states and 532 transitions. [2021-11-22 23:12:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 532 transitions. [2021-11-22 23:12:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:12:20,181 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:20,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 221 states and 533 transitions. [2021-11-22 23:12:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 533 transitions. [2021-11-22 23:12:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:12:21,255 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:21,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 225 states and 540 transitions. [2021-11-22 23:12:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 540 transitions. [2021-11-22 23:12:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:12:24,129 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:24,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 228 states and 545 transitions. [2021-11-22 23:12:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 545 transitions. [2021-11-22 23:12:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 23:12:26,598 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:26,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 229 states and 547 transitions. [2021-11-22 23:12:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 547 transitions. [2021-11-22 23:12:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:12:27,629 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:27,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 240 states and 593 transitions. [2021-11-22 23:12:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 593 transitions. [2021-11-22 23:12:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:12:35,430 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:35,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 242 states and 595 transitions. [2021-11-22 23:12:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 595 transitions. [2021-11-22 23:12:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:12:38,268 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:38,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 243 states and 596 transitions. [2021-11-22 23:12:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 596 transitions. [2021-11-22 23:12:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:12:39,229 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:39,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 242 states and 594 transitions. [2021-11-22 23:12:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 594 transitions. [2021-11-22 23:12:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-22 23:12:39,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:39,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 234 states and 584 transitions. [2021-11-22 23:12:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 584 transitions. [2021-11-22 23:12:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:12:40,016 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:40,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 244 states and 627 transitions. [2021-11-22 23:12:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 627 transitions. [2021-11-22 23:12:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:12:47,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:47,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 246 states and 629 transitions. [2021-11-22 23:12:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 629 transitions. [2021-11-22 23:12:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:12:50,169 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:50,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 247 states and 636 transitions. [2021-11-22 23:12:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 636 transitions. [2021-11-22 23:12:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 23:12:51,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:51,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:12:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:12:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 240 states and 627 transitions. [2021-11-22 23:12:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 627 transitions. [2021-11-22 23:12:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:12:52,253 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:12:52,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:12:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:12:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 268 states and 692 transitions. [2021-11-22 23:13:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 692 transitions. [2021-11-22 23:13:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:13:08,327 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:08,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 274 states and 709 transitions. [2021-11-22 23:13:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 709 transitions. [2021-11-22 23:13:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:13:12,496 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:12,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 275 states and 733 transitions. [2021-11-22 23:13:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 733 transitions. [2021-11-22 23:13:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:13:13,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:13,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 279 states and 743 transitions. [2021-11-22 23:13:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 743 transitions. [2021-11-22 23:13:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:13:16,582 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:16,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 280 states and 749 transitions. [2021-11-22 23:13:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 749 transitions. [2021-11-22 23:13:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:13:17,743 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:17,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 282 states and 751 transitions. [2021-11-22 23:13:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 751 transitions. [2021-11-22 23:13:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 23:13:18,757 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:18,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 283 states and 756 transitions. [2021-11-22 23:13:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 756 transitions. [2021-11-22 23:13:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 23:13:19,733 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:19,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 287 states and 769 transitions. [2021-11-22 23:13:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 769 transitions. [2021-11-22 23:13:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 23:13:26,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:26,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 288 states and 774 transitions. [2021-11-22 23:13:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 774 transitions. [2021-11-22 23:13:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 23:13:28,448 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:28,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 289 states and 777 transitions. [2021-11-22 23:13:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 777 transitions. [2021-11-22 23:13:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:13:29,534 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:29,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 293 states and 789 transitions. [2021-11-22 23:13:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 789 transitions. [2021-11-22 23:13:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:13:33,504 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:33,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 294 states and 793 transitions. [2021-11-22 23:13:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 793 transitions. [2021-11-22 23:13:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:13:34,547 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:34,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 295 states and 795 transitions. [2021-11-22 23:13:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 795 transitions. [2021-11-22 23:13:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-22 23:13:35,855 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:35,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 296 states and 800 transitions. [2021-11-22 23:13:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 800 transitions. [2021-11-22 23:13:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 23:13:36,904 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:36,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 299 states and 809 transitions. [2021-11-22 23:13:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 809 transitions. [2021-11-22 23:13:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 23:13:43,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:43,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 300 states and 811 transitions. [2021-11-22 23:13:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 811 transitions. [2021-11-22 23:13:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 23:13:44,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:44,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 301 states and 813 transitions. [2021-11-22 23:13:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 813 transitions. [2021-11-22 23:13:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 23:13:45,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:45,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:13:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:13:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:13:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 302 states and 816 transitions. [2021-11-22 23:13:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 816 transitions. [2021-11-22 23:13:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-22 23:13:46,733 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:13:46,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:13:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:13:47,444 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:13:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:13:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:13:49,585 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:13:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:13:50,159 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 70 iterations. [2021-11-22 23:13:50,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 11:13:50 ImpRootNode [2021-11-22 23:13:50,450 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-22 23:13:50,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 23:13:50,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 23:13:50,451 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 23:13:50,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:10:45" (3/4) ... [2021-11-22 23:13:50,453 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-22 23:13:50,725 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-22 23:13:50,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 23:13:50,726 INFO L158 Benchmark]: Toolchain (without parser) took 186790.46ms. Allocated memory was 86.0MB in the beginning and 1.9GB in the end (delta: 1.9GB). Free memory was 48.8MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 471.4MB. Max. memory is 16.1GB. [2021-11-22 23:13:50,726 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 86.0MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 23:13:50,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.50ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 48.6MB in the beginning and 89.0MB in the end (delta: -40.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 23:13:50,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.37ms. Allocated memory is still 119.5MB. Free memory was 89.0MB in the beginning and 86.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 23:13:50,728 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 119.5MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 23:13:50,728 INFO L158 Benchmark]: RCFGBuilder took 1509.25ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.7MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2021-11-22 23:13:50,729 INFO L158 Benchmark]: CodeCheck took 184488.19ms. Allocated memory was 119.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 81.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 451.5MB. Max. memory is 16.1GB. [2021-11-22 23:13:50,729 INFO L158 Benchmark]: Witness Printer took 274.40ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-22 23:13:50,731 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 184.2s, OverallIterations: 70, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32235 SdHoareTripleChecker+Valid, 236.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29880 mSDsluCounter, 8018 SdHoareTripleChecker+Invalid, 208.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6697 mSDsCounter, 10231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94550 IncrementalHoareTripleChecker+Invalid, 104781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10231 mSolverCounterUnsat, 1321 mSDtfsCounter, 94550 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22494 GetRequests, 20399 SyntacticMatches, 995 SemanticMatches, 1100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696668 ImplicationChecksByTransitivity, 155.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 10.5s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 2027 NumberOfCodeBlocks, 2027 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1910 ConstructedInterpolants, 0 QuantifiedInterpolants, 20707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 224/1150 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND TRUE \read(r131) [L232] COND TRUE \read(ep32) [L233] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND TRUE \read(r211) [L271] COND TRUE \read(ep13) [L272] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [c1=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, i2=0, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 1 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, i2=1, id1=1, id2=5, id3=3, m1=-2, m2=-2, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND TRUE (int )m1 > (int )max1 [L81] max1 = m1 [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, i2=2, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND FALSE !((int )r1 < 1) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, i2=3, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L555] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=255, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 86.0MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.50ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 48.6MB in the beginning and 89.0MB in the end (delta: -40.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.37ms. Allocated memory is still 119.5MB. Free memory was 89.0MB in the beginning and 86.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 119.5MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1509.25ms. Allocated memory is still 119.5MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.7MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * CodeCheck took 184488.19ms. Allocated memory was 119.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 81.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 451.5MB. Max. memory is 16.1GB. * Witness Printer took 274.40ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-22 23:13:50,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8db19613-eac4-4fef-85df-6eb3197ec875/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE