./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4 --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 c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-15 02:10:06,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 02:10:06,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 02:10:06,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 02:10:06,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 02:10:06,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 02:10:06,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 02:10:06,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 02:10:06,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 02:10:06,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 02:10:06,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 02:10:06,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 02:10:06,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 02:10:06,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 02:10:06,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 02:10:06,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 02:10:06,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 02:10:06,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 02:10:06,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 02:10:06,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 02:10:06,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 02:10:06,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 02:10:06,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 02:10:06,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 02:10:06,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 02:10:06,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 02:10:06,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 02:10:06,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 02:10:06,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 02:10:06,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 02:10:06,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 02:10:06,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 02:10:06,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 02:10:06,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 02:10:06,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 02:10:06,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 02:10:06,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 02:10:06,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 02:10:06,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 02:10:06,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 02:10:06,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 02:10:06,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 02:10:06,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 02:10:06,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 02:10:06,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 02:10:06,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 02:10:06,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 02:10:06,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 02:10:06,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 02:10:06,435 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 02:10:06,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 02:10:06,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 02:10:06,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 02:10:06,435 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 02:10:06,435 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 02:10:06,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 02:10:06,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 02:10:06,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 02:10:06,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 02:10:06,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 02:10:06,436 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 02:10:06,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 02:10:06,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 02:10:06,436 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_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/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_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4 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 -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2022-12-15 02:10:06,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 02:10:06,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 02:10:06,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 02:10:06,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 02:10:06,629 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 02:10:06,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-12-15 02:10:09,171 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 02:10:09,313 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 02:10:09,313 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-12-15 02:10:09,319 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/data/0a0cb25e8/d329bda804c04e15b5da3c4fcccbc1ef/FLAG150aa0bc2 [2022-12-15 02:10:09,330 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/data/0a0cb25e8/d329bda804c04e15b5da3c4fcccbc1ef [2022-12-15 02:10:09,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 02:10:09,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 02:10:09,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 02:10:09,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 02:10:09,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 02:10:09,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510b5e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09, skipping insertion in model container [2022-12-15 02:10:09,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 02:10:09,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 02:10:09,551 WARN L237 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_99a94d7b-736a-4103-98f8-95fab99c871d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2022-12-15 02:10:09,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 02:10:09,566 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 02:10:09,622 WARN L237 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_99a94d7b-736a-4103-98f8-95fab99c871d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2022-12-15 02:10:09,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 02:10:09,639 INFO L208 MainTranslator]: Completed translation [2022-12-15 02:10:09,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09 WrapperNode [2022-12-15 02:10:09,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 02:10:09,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 02:10:09,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 02:10:09,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 02:10:09,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,687 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2022-12-15 02:10:09,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 02:10:09,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 02:10:09,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 02:10:09,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 02:10:09,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,717 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 02:10:09,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 02:10:09,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 02:10:09,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 02:10:09,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:10:09" (1/1) ... [2022-12-15 02:10:09,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 02:10:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 02:10:09,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 02:10:09,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 02:10:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 02:10:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 02:10:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 02:10:09,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 02:10:09,871 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 02:10:09,872 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 02:10:10,277 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 02:10:10,596 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 02:10:10,596 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 02:10:10,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:10:10 BoogieIcfgContainer [2022-12-15 02:10:10,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 02:10:10,599 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 02:10:10,599 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 02:10:10,606 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 02:10:10,606 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:10:10" (1/1) ... [2022-12-15 02:10:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 02:10:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-15 02:10:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-15 02:10:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-15 02:10:10,651 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2022-12-15 02:10:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2022-12-15 02:10:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-15 02:10:11,755 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2022-12-15 02:10:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2022-12-15 02:10:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-15 02:10:12,567 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 28 states and 51 transitions. [2022-12-15 02:10:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2022-12-15 02:10:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-15 02:10:13,540 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 33 states and 63 transitions. [2022-12-15 02:10:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 63 transitions. [2022-12-15 02:10:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-15 02:10:14,513 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 40 states and 77 transitions. [2022-12-15 02:10:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 77 transitions. [2022-12-15 02:10:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-15 02:10:15,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 46 states and 90 transitions. [2022-12-15 02:10:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2022-12-15 02:10:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-15 02:10:17,328 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:17,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 47 states and 90 transitions. [2022-12-15 02:10:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 90 transitions. [2022-12-15 02:10:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 02:10:17,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 48 states and 91 transitions. [2022-12-15 02:10:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 91 transitions. [2022-12-15 02:10:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 02:10:17,620 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 58 states and 109 transitions. [2022-12-15 02:10:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2022-12-15 02:10:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-15 02:10:19,895 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:19,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 61 states and 115 transitions. [2022-12-15 02:10:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 115 transitions. [2022-12-15 02:10:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-15 02:10:20,268 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 77 states and 151 transitions. [2022-12-15 02:10:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 151 transitions. [2022-12-15 02:10:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-15 02:10:25,688 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:25,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 94 states and 182 transitions. [2022-12-15 02:10:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 182 transitions. [2022-12-15 02:10:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 02:10:32,120 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 108 states and 207 transitions. [2022-12-15 02:10:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 207 transitions. [2022-12-15 02:10:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 02:10:36,625 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 117 states and 227 transitions. [2022-12-15 02:10:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 227 transitions. [2022-12-15 02:10:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 02:10:42,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 131 states and 251 transitions. [2022-12-15 02:10:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 251 transitions. [2022-12-15 02:10:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-15 02:10:47,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:10:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:10:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 150 states and 285 transitions. [2022-12-15 02:10:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 285 transitions. [2022-12-15 02:10:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-15 02:10:54,810 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:10:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:10:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:10:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 169 states and 321 transitions. [2022-12-15 02:11:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 321 transitions. [2022-12-15 02:11:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-15 02:11:01,316 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 192 states and 356 transitions. [2022-12-15 02:11:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 356 transitions. [2022-12-15 02:11:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-15 02:11:11,172 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 197 states and 369 transitions. [2022-12-15 02:11:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 369 transitions. [2022-12-15 02:11:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-15 02:11:15,665 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 211 states and 420 transitions. [2022-12-15 02:11:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 420 transitions. [2022-12-15 02:11:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-15 02:11:25,304 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:25,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 224 states and 443 transitions. [2022-12-15 02:11:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 443 transitions. [2022-12-15 02:11:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 02:11:34,357 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 234 states and 461 transitions. [2022-12-15 02:11:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 461 transitions. [2022-12-15 02:11:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 02:11:40,541 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 244 states and 479 transitions. [2022-12-15 02:11:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 479 transitions. [2022-12-15 02:11:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 02:11:45,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 245 states and 481 transitions. [2022-12-15 02:11:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 481 transitions. [2022-12-15 02:11:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 02:11:47,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:11:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:11:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 255 states and 510 transitions. [2022-12-15 02:11:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 510 transitions. [2022-12-15 02:11:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 02:11:54,010 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:11:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:11:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:11:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 267 states and 535 transitions. [2022-12-15 02:12:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 535 transitions. [2022-12-15 02:12:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 02:12:00,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 268 states and 537 transitions. [2022-12-15 02:12:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 537 transitions. [2022-12-15 02:12:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 02:12:02,418 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 269 states and 539 transitions. [2022-12-15 02:12:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 539 transitions. [2022-12-15 02:12:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 02:12:03,806 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 283 states and 578 transitions. [2022-12-15 02:12:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 578 transitions. [2022-12-15 02:12:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 02:12:12,330 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 299 states and 620 transitions. [2022-12-15 02:12:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 620 transitions. [2022-12-15 02:12:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 02:12:20,991 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 312 states and 648 transitions. [2022-12-15 02:12:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 648 transitions. [2022-12-15 02:12:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 02:12:32,160 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 313 states and 651 transitions. [2022-12-15 02:12:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 651 transitions. [2022-12-15 02:12:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 02:12:33,710 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 320 states and 672 transitions. [2022-12-15 02:12:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 672 transitions. [2022-12-15 02:12:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 02:12:43,971 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 324 states and 682 transitions. [2022-12-15 02:12:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 682 transitions. [2022-12-15 02:12:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 02:12:48,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:48,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 326 states and 687 transitions. [2022-12-15 02:12:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 687 transitions. [2022-12-15 02:12:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 02:12:51,690 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 327 states and 692 transitions. [2022-12-15 02:12:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 692 transitions. [2022-12-15 02:12:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 02:12:54,042 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 328 states and 701 transitions. [2022-12-15 02:12:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 701 transitions. [2022-12-15 02:12:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 02:12:56,252 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:12:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:12:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:12:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 329 states and 704 transitions. [2022-12-15 02:12:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 704 transitions. [2022-12-15 02:12:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 02:12:58,208 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:12:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:12:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 334 states and 721 transitions. [2022-12-15 02:13:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 721 transitions. [2022-12-15 02:13:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 02:13:05,219 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 342 states and 745 transitions. [2022-12-15 02:13:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 745 transitions. [2022-12-15 02:13:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 02:13:13,069 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 344 states and 754 transitions. [2022-12-15 02:13:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 754 transitions. [2022-12-15 02:13:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 02:13:15,754 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 345 states and 761 transitions. [2022-12-15 02:13:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 761 transitions. [2022-12-15 02:13:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 02:13:17,760 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 346 states and 766 transitions. [2022-12-15 02:13:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 766 transitions. [2022-12-15 02:13:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:13:19,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 369 states and 804 transitions. [2022-12-15 02:13:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 804 transitions. [2022-12-15 02:13:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:13:31,923 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:31,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 377 states and 826 transitions. [2022-12-15 02:13:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 826 transitions. [2022-12-15 02:13:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:13:43,412 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 379 states and 828 transitions. [2022-12-15 02:13:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 828 transitions. [2022-12-15 02:13:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:13:47,520 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 381 states and 841 transitions. [2022-12-15 02:13:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 841 transitions. [2022-12-15 02:13:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:13:55,344 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:13:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:13:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:13:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 384 states and 851 transitions. [2022-12-15 02:13:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 851 transitions. [2022-12-15 02:13:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:13:59,233 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:13:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:13:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:14:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:14:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:14:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 385 states and 853 transitions. [2022-12-15 02:14:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 853 transitions. [2022-12-15 02:14:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:14:01,618 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:14:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:14:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:14:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:14:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:14:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 387 states and 867 transitions. [2022-12-15 02:14:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 867 transitions. [2022-12-15 02:14:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 02:14:04,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:14:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:14:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:14:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 02:14:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:14:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 388 states and 874 transitions. [2022-12-15 02:14:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 874 transitions. [2022-12-15 02:14:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-15 02:14:07,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:14:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:14:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 02:14:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-15 02:14:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 02:14:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 388 states and 873 transitions. [2022-12-15 02:14:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 873 transitions. [2022-12-15 02:14:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-15 02:14:08,298 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 02:14:08,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 02:14:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 02:14:08,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 02:14:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 02:14:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 02:14:09,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 02:14:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 02:14:09,758 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 iterations. [2022-12-15 02:14:09,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 02:14:09 ImpRootNode [2022-12-15 02:14:09,891 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 02:14:09,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 02:14:09,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 02:14:09,892 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 02:14:09,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:10:10" (3/4) ... [2022-12-15 02:14:09,894 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 02:14:10,009 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 02:14:10,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 02:14:10,009 INFO L158 Benchmark]: Toolchain (without parser) took 240676.82ms. Allocated memory was 121.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 80.4MB in the beginning and 831.6MB in the end (delta: -751.1MB). Peak memory consumption was 849.0MB. Max. memory is 16.1GB. [2022-12-15 02:14:10,009 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 89.6MB in the beginning and 89.6MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 02:14:10,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.44ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 63.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-15 02:14:10,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.49ms. Allocated memory is still 121.6MB. Free memory was 63.6MB in the beginning and 60.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 02:14:10,010 INFO L158 Benchmark]: Boogie Preprocessor took 33.95ms. Allocated memory is still 121.6MB. Free memory was 60.5MB in the beginning and 58.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 02:14:10,011 INFO L158 Benchmark]: RCFGBuilder took 875.31ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 57.9MB in the beginning and 108.5MB in the end (delta: -50.6MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2022-12-15 02:14:10,011 INFO L158 Benchmark]: CodeCheck took 239292.28ms. Allocated memory was 155.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 108.5MB in the beginning and 847.3MB in the end (delta: -738.8MB). Peak memory consumption was 825.6MB. Max. memory is 16.1GB. [2022-12-15 02:14:10,011 INFO L158 Benchmark]: Witness Printer took 117.19ms. Allocated memory is still 1.7GB. Free memory was 847.3MB in the beginning and 831.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-15 02:14:10,013 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: 239.1s, OverallIterations: 53, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27632 SdHoareTripleChecker+Valid, 166.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25982 mSDsluCounter, 8978 SdHoareTripleChecker+Invalid, 147.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8132 mSDsCounter, 7711 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74783 IncrementalHoareTripleChecker+Invalid, 82494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7711 mSolverCounterUnsat, 846 mSDtfsCounter, 74783 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18218 GetRequests, 16269 SyntacticMatches, 651 SemanticMatches, 1298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018679 ImplicationChecksByTransitivity, 181.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 58.1s InterpolantComputationTime, 1651 NumberOfCodeBlocks, 1651 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1551 ConstructedInterpolants, 0 QuantifiedInterpolants, 17026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 11 PerfectInterpolantSequences, 222/1099 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: 573]: 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] _Bool newmax1 ; [L57] char id2 ; [L58] char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] _Bool newmax2 ; [L65] char id3 ; [L66] char r3 ; [L67] char st3 ; [L68] char nl3 ; [L69] char m3 ; [L70] char max3 ; [L71] _Bool mode3 ; [L72] _Bool newmax3 ; [L491] int c1 ; [L492] int i2 ; [L495] c1 = 0 [L496] ep12 = __VERIFIER_nondet_bool() [L497] ep13 = __VERIFIER_nondet_bool() [L498] ep21 = __VERIFIER_nondet_bool() [L499] ep23 = __VERIFIER_nondet_bool() [L500] ep31 = __VERIFIER_nondet_bool() [L501] ep32 = __VERIFIER_nondet_bool() [L502] id1 = __VERIFIER_nondet_char() [L503] r1 = __VERIFIER_nondet_char() [L504] st1 = __VERIFIER_nondet_char() [L505] nl1 = __VERIFIER_nondet_char() [L506] m1 = __VERIFIER_nondet_char() [L507] max1 = __VERIFIER_nondet_char() [L508] mode1 = __VERIFIER_nondet_bool() [L509] newmax1 = __VERIFIER_nondet_bool() [L510] id2 = __VERIFIER_nondet_char() [L511] r2 = __VERIFIER_nondet_char() [L512] st2 = __VERIFIER_nondet_char() [L513] nl2 = __VERIFIER_nondet_char() [L514] m2 = __VERIFIER_nondet_char() [L515] max2 = __VERIFIER_nondet_char() [L516] mode2 = __VERIFIER_nondet_bool() [L517] newmax2 = __VERIFIER_nondet_bool() [L518] id3 = __VERIFIER_nondet_char() [L519] r3 = __VERIFIER_nondet_char() [L520] st3 = __VERIFIER_nondet_char() [L521] nl3 = __VERIFIER_nondet_char() [L522] m3 = __VERIFIER_nondet_char() [L523] max3 = __VERIFIER_nondet_char() [L524] mode3 = __VERIFIER_nondet_bool() [L525] newmax3 = __VERIFIER_nondet_bool() [L526] CALL, EXPR init() [L228] _Bool r121 ; [L229] _Bool r131 ; [L230] _Bool r211 ; [L231] _Bool r231 ; [L232] _Bool r311 ; [L233] _Bool r321 ; [L234] _Bool r122 ; [L235] int tmp ; [L236] _Bool r132 ; [L237] int tmp___0 ; [L238] _Bool r212 ; [L239] int tmp___1 ; [L240] _Bool r232 ; [L241] int tmp___2 ; [L242] _Bool r312 ; [L243] int tmp___3 ; [L244] _Bool r322 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L249] r121 = ep12 [L250] r131 = ep13 [L251] r211 = ep21 [L252] r231 = ep23 [L253] r311 = ep31 [L254] r321 = ep32 [L255] COND TRUE \read(r121) [L256] tmp = 1 [L267] r122 = (_Bool )tmp [L268] COND FALSE !(\read(r131)) [L271] COND TRUE \read(r121) [L272] COND TRUE \read(ep23) [L273] tmp___0 = 1 [L280] r132 = (_Bool )tmp___0 [L281] COND FALSE !(\read(r211)) [L284] COND TRUE \read(r231) [L285] COND FALSE !(\read(ep31)) [L288] tmp___1 = 0 [L293] r212 = (_Bool )tmp___1 [L294] COND TRUE \read(r231) [L295] tmp___2 = 1 [L306] r232 = (_Bool )tmp___2 [L307] COND FALSE !(\read(r311)) [L310] COND FALSE !(\read(r321)) [L317] tmp___3 = 0 [L319] r312 = (_Bool )tmp___3 [L320] COND FALSE !(\read(r321)) [L323] COND FALSE !(\read(r311)) [L330] tmp___4 = 0 [L332] r322 = (_Bool )tmp___4 [L333] COND TRUE (int )id1 != (int )id2 [L334] COND TRUE (int )id1 != (int )id3 [L335] COND TRUE (int )id2 != (int )id3 [L336] COND TRUE (int )id1 >= 0 [L337] COND TRUE (int )id2 >= 0 [L338] COND TRUE (int )id3 >= 0 [L339] COND TRUE (int )r1 == 0 [L340] COND TRUE (int )r2 == 0 [L341] COND TRUE (int )r3 == 0 [L342] COND TRUE (int )max1 == (int )id1 [L343] COND TRUE (int )max2 == (int )id2 [L344] COND TRUE (int )max3 == (int )id3 [L345] COND TRUE (int )st1 == 0 [L346] COND TRUE (int )st2 == 0 [L347] COND TRUE (int )st3 == 0 [L348] COND TRUE (int )nl1 == 0 [L349] COND TRUE (int )nl2 == 0 [L350] COND TRUE (int )nl3 == 0 [L351] COND TRUE (int )mode1 == 0 [L352] COND TRUE (int )mode2 == 0 [L353] COND TRUE (int )mode3 == 0 [L354] COND TRUE \read(newmax1) [L355] COND TRUE \read(newmax2) [L356] COND TRUE \read(newmax3) [L357] tmp___5 = 1 [L430] return (tmp___5); [L526] RET, EXPR init() [L526] i2 = init() [L527] COND FALSE !(!(i2)) [L528] p12_old = nomsg [L529] p12_new = nomsg [L530] p13_old = nomsg [L531] p13_new = nomsg [L532] p21_old = nomsg [L533] p21_new = nomsg [L534] p23_old = nomsg [L535] p23_new = nomsg [L536] p31_old = nomsg [L537] p31_new = nomsg [L538] p32_old = nomsg [L539] p32_new = nomsg [L540] i2 = 0 VAL [c1=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=-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] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] COND TRUE \read(newmax1) [L110] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND TRUE \read(newmax2) [L166] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L447] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=1, id1=124, id2=125, id3=126, m1=-1, m2=-2, m3=127, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND TRUE \read(ep12) [L133] m2 = p12_old [L134] p12_old = nomsg [L135] COND FALSE !((int )m2 > (int )max2) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND FALSE !((int )r2 == 2) [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND FALSE !((int )m3 > (int )max3) [L199] newmax3 = newmax [L200] COND FALSE !((int )r3 == 2) [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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 )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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 FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L447] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=2, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] COND FALSE !(\read(newmax1)) [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND FALSE !(\read(newmax2)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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 )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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 FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L447] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=3, id1=124, id2=125, id3=126, m1=-1, m2=124, m3=125, max1=124, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=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] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND TRUE \read(ep12) [L133] m2 = p12_old [L134] p12_old = nomsg [L135] COND FALSE !((int )m2 > (int )max2) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND TRUE (int )r2 == 2 [L150] COND TRUE (int )max2 == (int )id2 [L151] st2 = (char)1 [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND FALSE !((int )m3 > (int )max3) [L199] newmax3 = newmax [L200] COND TRUE (int )r3 == 2 [L201] COND TRUE (int )max3 == (int )id3 [L202] st3 = (char)1 [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L438] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L484] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L573] reach_error() VAL [\old(arg)=0, arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=124, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 89.6MB in the beginning and 89.6MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.44ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 63.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.49ms. Allocated memory is still 121.6MB. Free memory was 63.6MB in the beginning and 60.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.95ms. Allocated memory is still 121.6MB. Free memory was 60.5MB in the beginning and 58.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 875.31ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 57.9MB in the beginning and 108.5MB in the end (delta: -50.6MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * CodeCheck took 239292.28ms. Allocated memory was 155.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 108.5MB in the beginning and 847.3MB in the end (delta: -738.8MB). Peak memory consumption was 825.6MB. Max. memory is 16.1GB. * Witness Printer took 117.19ms. Allocated memory is still 1.7GB. Free memory was 847.3MB in the beginning and 831.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 02:14:10,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_99a94d7b-736a-4103-98f8-95fab99c871d/bin/ukojak-rkRKPMF4O4/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