./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/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_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/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_74104d51-c6ce-4ab4-9f39-95067487472e/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 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- 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-14 23:16:53,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 23:16:53,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 23:16:53,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 23:16:53,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 23:16:53,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 23:16:53,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 23:16:53,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 23:16:53,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 23:16:53,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 23:16:53,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 23:16:53,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 23:16:53,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 23:16:53,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 23:16:53,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 23:16:53,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 23:16:53,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 23:16:53,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 23:16:53,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 23:16:53,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 23:16:53,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 23:16:53,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 23:16:53,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 23:16:53,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 23:16:53,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 23:16:53,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 23:16:53,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 23:16:53,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 23:16:53,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 23:16:53,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 23:16:53,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 23:16:53,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 23:16:53,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 23:16:53,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 23:16:53,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 23:16:53,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 23:16:53,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 23:16:53,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 23:16:53,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 23:16:53,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 23:16:53,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 23:16:53,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 23:16:53,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 23:16:53,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 23:16:53,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 23:16:53,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 23:16:53,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 23:16:53,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 23:16:53,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 23:16:53,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 23:16:53,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 23:16:53,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 23:16:53,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 23:16:53,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 23:16:53,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 23:16:53,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 23:16:53,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 23:16:53,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 23:16:53,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 23:16:53,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 23:16:53,119 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 23:16:53,120 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 23:16:53,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 23:16:53,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:16:53,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 23:16:53,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 23:16:53,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 23:16:53,121 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 23:16:53,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 23:16:53,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 23:16:53,121 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_74104d51-c6ce-4ab4-9f39-95067487472e/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_74104d51-c6ce-4ab4-9f39-95067487472e/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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2022-12-14 23:16:53,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 23:16:53,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 23:16:53,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 23:16:53,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 23:16:53,346 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 23:16:53,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-12-14 23:16:55,980 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 23:16:56,115 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 23:16:56,115 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-12-14 23:16:56,122 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/data/05561e011/718152d6559f48b2b6a55e8c3be6c93c/FLAGc178d7414 [2022-12-14 23:16:56,132 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/data/05561e011/718152d6559f48b2b6a55e8c3be6c93c [2022-12-14 23:16:56,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 23:16:56,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 23:16:56,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 23:16:56,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 23:16:56,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 23:16:56,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d8b5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56, skipping insertion in model container [2022-12-14 23:16:56,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 23:16:56,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 23:16:56,314 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_74104d51-c6ce-4ab4-9f39-95067487472e/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2022-12-14 23:16:56,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:16:56,326 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 23:16:56,366 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_74104d51-c6ce-4ab4-9f39-95067487472e/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2022-12-14 23:16:56,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:16:56,377 INFO L208 MainTranslator]: Completed translation [2022-12-14 23:16:56,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56 WrapperNode [2022-12-14 23:16:56,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 23:16:56,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 23:16:56,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 23:16:56,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 23:16:56,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,414 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2022-12-14 23:16:56,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 23:16:56,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 23:16:56,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 23:16:56,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 23:16:56,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,435 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 23:16:56,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 23:16:56,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 23:16:56,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 23:16:56,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:16:56" (1/1) ... [2022-12-14 23:16:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:16:56,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 23:16:56,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 23:16:56,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 23:16:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 23:16:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 23:16:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 23:16:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 23:16:56,585 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 23:16:56,586 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 23:16:56,933 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 23:16:57,281 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 23:16:57,281 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 23:16:57,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:16:57 BoogieIcfgContainer [2022-12-14 23:16:57,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 23:16:57,283 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 23:16:57,283 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 23:16:57,290 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 23:16:57,291 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:16:57" (1/1) ... [2022-12-14 23:16:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 23:16:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:16:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 23:16:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 23:16:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 23:16:57,336 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:16:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:16:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:16:58,521 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-14 23:16:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:16:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2022-12-14 23:16:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2022-12-14 23:16:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 23:16:58,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:16:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:16:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:16:59,358 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-14 23:16:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:16:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 24 states and 42 transitions. [2022-12-14 23:16:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2022-12-14 23:16:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 23:16:59,574 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:16:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:16:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:00,370 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-14 23:17:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 28 states and 52 transitions. [2022-12-14 23:17:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. [2022-12-14 23:17:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 23:17:00,677 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:01,196 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-14 23:17:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 33 states and 64 transitions. [2022-12-14 23:17:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 64 transitions. [2022-12-14 23:17:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 23:17:01,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:02,242 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-14 23:17:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 40 states and 78 transitions. [2022-12-14 23:17:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 78 transitions. [2022-12-14 23:17:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 23:17:02,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:03,375 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-14 23:17:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 46 states and 91 transitions. [2022-12-14 23:17:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 91 transitions. [2022-12-14 23:17:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 23:17:04,144 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:04,208 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-14 23:17:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 47 states and 91 transitions. [2022-12-14 23:17:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 91 transitions. [2022-12-14 23:17:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 23:17:04,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:04,409 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-14 23:17:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 48 states and 92 transitions. [2022-12-14 23:17:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2022-12-14 23:17:04,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 23:17:04,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:05,066 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-14 23:17:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 58 states and 110 transitions. [2022-12-14 23:17:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 110 transitions. [2022-12-14 23:17:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 23:17:06,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:06,704 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-14 23:17:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 61 states and 116 transitions. [2022-12-14 23:17:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 116 transitions. [2022-12-14 23:17:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 23:17:06,882 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:08,342 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-14 23:17:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 77 states and 152 transitions. [2022-12-14 23:17:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 152 transitions. [2022-12-14 23:17:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 23:17:11,727 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:13,161 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-14 23:17:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 94 states and 188 transitions. [2022-12-14 23:17:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 188 transitions. [2022-12-14 23:17:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 23:17:18,646 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:19,890 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-14 23:17:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 101 states and 204 transitions. [2022-12-14 23:17:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 204 transitions. [2022-12-14 23:17:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 23:17:23,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:25,182 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-14 23:17:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 119 states and 241 transitions. [2022-12-14 23:17:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 241 transitions. [2022-12-14 23:17:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 23:17:30,673 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:31,638 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-14 23:17:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 137 states and 278 transitions. [2022-12-14 23:17:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 278 transitions. [2022-12-14 23:17:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 23:17:37,835 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:39,422 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-14 23:17:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 146 states and 303 transitions. [2022-12-14 23:17:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 303 transitions. [2022-12-14 23:17:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 23:17:45,560 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:46,999 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-14 23:17:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 147 states and 304 transitions. [2022-12-14 23:17:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 304 transitions. [2022-12-14 23:17:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 23:17:47,906 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:49,595 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-14 23:17:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:17:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 164 states and 335 transitions. [2022-12-14 23:17:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 335 transitions. [2022-12-14 23:17:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 23:17:56,524 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:17:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:17:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:17:57,428 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-14 23:18:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 170 states and 357 transitions. [2022-12-14 23:18:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 357 transitions. [2022-12-14 23:18:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 23:18:01,109 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:02,090 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-14 23:18:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 172 states and 360 transitions. [2022-12-14 23:18:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 360 transitions. [2022-12-14 23:18:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 23:18:03,261 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:03,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:04,335 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-14 23:18:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 173 states and 361 transitions. [2022-12-14 23:18:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 361 transitions. [2022-12-14 23:18:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 23:18:04,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:04,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:05,376 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-14 23:18:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 176 states and 372 transitions. [2022-12-14 23:18:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 372 transitions. [2022-12-14 23:18:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 23:18:06,378 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:08,327 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-14 23:18:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 188 states and 402 transitions. [2022-12-14 23:18:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 402 transitions. [2022-12-14 23:18:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 23:18:14,921 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:17,130 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-14 23:18:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 191 states and 413 transitions. [2022-12-14 23:18:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 413 transitions. [2022-12-14 23:18:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 23:18:19,164 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:21,148 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-14 23:18:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 195 states and 422 transitions. [2022-12-14 23:18:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 422 transitions. [2022-12-14 23:18:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 23:18:24,085 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:18:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 195 states and 421 transitions. [2022-12-14 23:18:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 421 transitions. [2022-12-14 23:18:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 23:18:24,479 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:26,350 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-14 23:18:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 209 states and 477 transitions. [2022-12-14 23:18:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 477 transitions. [2022-12-14 23:18:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 23:18:33,946 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:36,570 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-14 23:18:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 223 states and 532 transitions. [2022-12-14 23:18:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 532 transitions. [2022-12-14 23:18:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 23:18:45,276 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:47,497 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-14 23:18:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:18:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 234 states and 584 transitions. [2022-12-14 23:18:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 584 transitions. [2022-12-14 23:18:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 23:18:56,392 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:18:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:18:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:18:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:19:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:19:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 244 states and 617 transitions. [2022-12-14 23:19:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 617 transitions. [2022-12-14 23:19:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 23:19:06,120 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:19:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:19:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:19:07,886 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-14 23:19:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:19:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 253 states and 640 transitions. [2022-12-14 23:19:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 640 transitions. [2022-12-14 23:19:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 23:19:13,942 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:19:13,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:19:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:19:16,828 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-14 23:19:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:19:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 262 states and 658 transitions. [2022-12-14 23:19:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 658 transitions. [2022-12-14 23:19:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 23:19:23,195 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:19:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:19:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:19:25,709 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-14 23:19:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:19:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 290 states and 734 transitions. [2022-12-14 23:19:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 734 transitions. [2022-12-14 23:19:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:19:42,998 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:19:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:19:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:19:44,605 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-14 23:19:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:19:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 301 states and 782 transitions. [2022-12-14 23:19:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 782 transitions. [2022-12-14 23:19:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:19:53,204 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:19:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:19:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:19:54,746 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-14 23:20:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 311 states and 810 transitions. [2022-12-14 23:20:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 810 transitions. [2022-12-14 23:20:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:02,232 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:03,428 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-14 23:20:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 315 states and 821 transitions. [2022-12-14 23:20:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 821 transitions. [2022-12-14 23:20:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:07,346 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:08,223 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-14 23:20:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 317 states and 825 transitions. [2022-12-14 23:20:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 825 transitions. [2022-12-14 23:20:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:10,175 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:11,380 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-14 23:20:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 326 states and 842 transitions. [2022-12-14 23:20:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 842 transitions. [2022-12-14 23:20:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:18,714 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:18,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:19,613 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-14 23:20:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 330 states and 849 transitions. [2022-12-14 23:20:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 849 transitions. [2022-12-14 23:20:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:23,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:20:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 350 states and 895 transitions. [2022-12-14 23:20:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 895 transitions. [2022-12-14 23:20:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:38,273 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:38,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:39,141 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-14 23:20:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 351 states and 894 transitions. [2022-12-14 23:20:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 894 transitions. [2022-12-14 23:20:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:41,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:41,868 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-14 23:20:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 353 states and 903 transitions. [2022-12-14 23:20:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 903 transitions. [2022-12-14 23:20:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:43,972 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:45,149 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-14 23:20:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 357 states and 907 transitions. [2022-12-14 23:20:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 907 transitions. [2022-12-14 23:20:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:20:47,294 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:48,156 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-14 23:20:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:20:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 361 states and 911 transitions. [2022-12-14 23:20:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 911 transitions. [2022-12-14 23:20:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 23:20:50,017 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:20:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:20:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:20:52,067 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-14 23:21:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 373 states and 946 transitions. [2022-12-14 23:21:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 946 transitions. [2022-12-14 23:21:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 23:21:02,607 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:03,508 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-14 23:21:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 386 states and 988 transitions. [2022-12-14 23:21:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 988 transitions. [2022-12-14 23:21:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 23:21:14,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:15,322 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-14 23:21:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 388 states and 1003 transitions. [2022-12-14 23:21:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1003 transitions. [2022-12-14 23:21:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 23:21:18,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:19,534 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-14 23:21:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 396 states and 1015 transitions. [2022-12-14 23:21:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1015 transitions. [2022-12-14 23:21:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 23:21:25,492 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:26,409 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-14 23:21:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 404 states and 1031 transitions. [2022-12-14 23:21:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1031 transitions. [2022-12-14 23:21:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 23:21:33,259 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:34,129 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-14 23:21:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 408 states and 1035 transitions. [2022-12-14 23:21:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1035 transitions. [2022-12-14 23:21:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 23:21:36,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:36,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:38,341 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-14 23:21:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 417 states and 1060 transitions. [2022-12-14 23:21:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1060 transitions. [2022-12-14 23:21:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 23:21:47,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:48,203 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-14 23:21:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 418 states and 1078 transitions. [2022-12-14 23:21:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1078 transitions. [2022-12-14 23:21:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 23:21:52,741 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:53,639 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-14 23:21:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:21:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 420 states and 1089 transitions. [2022-12-14 23:21:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1089 transitions. [2022-12-14 23:21:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 23:21:55,858 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:21:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:21:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:21:58,463 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-14 23:22:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 429 states and 1113 transitions. [2022-12-14 23:22:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1113 transitions. [2022-12-14 23:22:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 23:22:08,338 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:10,096 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-14 23:22:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 430 states and 1123 transitions. [2022-12-14 23:22:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1123 transitions. [2022-12-14 23:22:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 23:22:12,767 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:13,645 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-14 23:22:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 438 states and 1134 transitions. [2022-12-14 23:22:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1134 transitions. [2022-12-14 23:22:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 23:22:20,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:21,264 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-14 23:22:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 446 states and 1145 transitions. [2022-12-14 23:22:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1145 transitions. [2022-12-14 23:22:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:22:28,557 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:28,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:31,134 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-14 23:22:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 451 states and 1162 transitions. [2022-12-14 23:22:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1162 transitions. [2022-12-14 23:22:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:22:40,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:40,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:42,484 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-14 23:22:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 456 states and 1182 transitions. [2022-12-14 23:22:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1182 transitions. [2022-12-14 23:22:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:22:50,269 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:51,408 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-14 23:22:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 457 states and 1190 transitions. [2022-12-14 23:22:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1190 transitions. [2022-12-14 23:22:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:22:53,005 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:54,154 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-14 23:22:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:22:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 458 states and 1196 transitions. [2022-12-14 23:22:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1196 transitions. [2022-12-14 23:22:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:22:55,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:22:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:22:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:22:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:23:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 469 states and 1230 transitions. [2022-12-14 23:23:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1230 transitions. [2022-12-14 23:23:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:23:10,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:12,159 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-14 23:23:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 475 states and 1253 transitions. [2022-12-14 23:23:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1253 transitions. [2022-12-14 23:23:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:23:22,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:23:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 474 states and 1251 transitions. [2022-12-14 23:23:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1251 transitions. [2022-12-14 23:23:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 23:23:28,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:29,858 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-14 23:23:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 478 states and 1258 transitions. [2022-12-14 23:23:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1258 transitions. [2022-12-14 23:23:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 23:23:34,731 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:35,900 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-14 23:23:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 482 states and 1286 transitions. [2022-12-14 23:23:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1286 transitions. [2022-12-14 23:23:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 23:23:41,779 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:43,153 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-14 23:23:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 488 states and 1309 transitions. [2022-12-14 23:23:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1309 transitions. [2022-12-14 23:23:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 23:23:50,014 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:50,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:50,874 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-14 23:23:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 489 states and 1318 transitions. [2022-12-14 23:23:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1318 transitions. [2022-12-14 23:23:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 23:23:52,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:53,574 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-14 23:23:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 490 states and 1324 transitions. [2022-12-14 23:23:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1324 transitions. [2022-12-14 23:23:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 23:23:55,045 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:23:55,963 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-14 23:23:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:23:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 493 states and 1328 transitions. [2022-12-14 23:23:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1328 transitions. [2022-12-14 23:23:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 23:23:59,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:23:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:23:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:00,279 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-14 23:24:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 496 states and 1332 transitions. [2022-12-14 23:24:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1332 transitions. [2022-12-14 23:24:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 23:24:03,942 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:07,538 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-14 23:24:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 499 states and 1336 transitions. [2022-12-14 23:24:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1336 transitions. [2022-12-14 23:24:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:24:12,250 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:14,172 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-14 23:24:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 506 states and 1361 transitions. [2022-12-14 23:24:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1361 transitions. [2022-12-14 23:24:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:24:24,991 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:26,156 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-14 23:24:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 513 states and 1396 transitions. [2022-12-14 23:24:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1396 transitions. [2022-12-14 23:24:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:24:37,870 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:39,024 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-14 23:24:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 517 states and 1415 transitions. [2022-12-14 23:24:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1415 transitions. [2022-12-14 23:24:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:24:44,592 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:44,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:45,803 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-14 23:24:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 518 states and 1419 transitions. [2022-12-14 23:24:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1419 transitions. [2022-12-14 23:24:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:24:47,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:47,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:48,608 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-14 23:24:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 519 states and 1421 transitions. [2022-12-14 23:24:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1421 transitions. [2022-12-14 23:24:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:24:49,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:52,328 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-14 23:24:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:24:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 521 states and 1424 transitions. [2022-12-14 23:24:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1424 transitions. [2022-12-14 23:24:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:24:58,487 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:24:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:24:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:24:59,738 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-14 23:25:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:25:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 523 states and 1435 transitions. [2022-12-14 23:25:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1435 transitions. [2022-12-14 23:25:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:25:01,461 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:25:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:25:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:25:02,711 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-14 23:25:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:25:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 525 states and 1438 transitions. [2022-12-14 23:25:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1438 transitions. [2022-12-14 23:25:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:25:08,119 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:25:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:25:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:25:12,407 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-14 23:25:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:25:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 531 states and 1445 transitions. [2022-12-14 23:25:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1445 transitions. [2022-12-14 23:25:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:25:22,767 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:25:22,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:25:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:25:24,037 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-14 23:25:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:25:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 533 states and 1448 transitions. [2022-12-14 23:25:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1448 transitions. [2022-12-14 23:25:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 23:25:29,438 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:25:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:25:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:25:29,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:25:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:25:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:25:31,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:25:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:25:31,591 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 83 iterations. [2022-12-14 23:25:31,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 11:25:31 ImpRootNode [2022-12-14 23:25:31,707 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 23:25:31,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 23:25:31,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 23:25:31,708 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 23:25:31,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:16:57" (3/4) ... [2022-12-14 23:25:31,710 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 23:25:31,914 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 23:25:31,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 23:25:31,915 INFO L158 Benchmark]: Toolchain (without parser) took 515779.64ms. Allocated memory was 138.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 102.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-12-14 23:25:31,915 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 23:25:31,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.94ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 85.9MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 23:25:31,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.37ms. Allocated memory is still 138.4MB. Free memory was 85.9MB in the beginning and 83.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 23:25:31,916 INFO L158 Benchmark]: Boogie Preprocessor took 24.96ms. Allocated memory is still 138.4MB. Free memory was 83.0MB in the beginning and 80.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 23:25:31,916 INFO L158 Benchmark]: RCFGBuilder took 843.08ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 80.5MB in the beginning and 85.4MB in the end (delta: -4.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-12-14 23:25:31,916 INFO L158 Benchmark]: CodeCheck took 514423.56ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 85.4MB in the beginning and 324.9MB in the end (delta: -239.4MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-12-14 23:25:31,916 INFO L158 Benchmark]: Witness Printer took 207.09ms. Allocated memory is still 1.9GB. Free memory was 324.9MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-12-14 23:25:31,917 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: 514.3s, OverallIterations: 83, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68713 SdHoareTripleChecker+Valid, 423.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65965 mSDsluCounter, 25825 SdHoareTripleChecker+Invalid, 375.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24469 mSDsCounter, 16501 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190797 IncrementalHoareTripleChecker+Invalid, 207298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16501 mSolverCounterUnsat, 1356 mSDtfsCounter, 190797 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34422 GetRequests, 31416 SyntacticMatches, 1112 SemanticMatches, 1894 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147160 ImplicationChecksByTransitivity, 417.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 8.8s SatisfiabilityAnalysisTime, 106.0s InterpolantComputationTime, 2668 NumberOfCodeBlocks, 2668 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 2538 ConstructedInterpolants, 0 QuantifiedInterpolants, 27117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 11 PerfectInterpolantSequences, 326/1771 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND TRUE \read(ep31) [L259] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND TRUE \read(r311) [L297] COND TRUE \read(ep12) [L298] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [c1=0, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, i2=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 1 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, i2=1, id1=1, id2=2, id3=3, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, i2=2, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND FALSE !((int )r1 < 1) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, i2=3, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L555] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=1, ep21=0, ep23=1, ep31=255, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.94ms. Allocated memory is still 138.4MB. Free memory was 101.9MB in the beginning and 85.9MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.37ms. Allocated memory is still 138.4MB. Free memory was 85.9MB in the beginning and 83.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.96ms. Allocated memory is still 138.4MB. Free memory was 83.0MB in the beginning and 80.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 843.08ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 80.5MB in the beginning and 85.4MB in the end (delta: -4.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * CodeCheck took 514423.56ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 85.4MB in the beginning and 324.9MB in the end (delta: -239.4MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 207.09ms. Allocated memory is still 1.9GB. Free memory was 324.9MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 23:25:31,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74104d51-c6ce-4ab4-9f39-95067487472e/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