./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/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_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/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_820bff1d-6948-4450-98ea-542482e72404/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 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- 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 19:47:32,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 19:47:32,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 19:47:32,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 19:47:32,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 19:47:32,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 19:47:32,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 19:47:32,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 19:47:32,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 19:47:32,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 19:47:32,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 19:47:32,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 19:47:32,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 19:47:32,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 19:47:32,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 19:47:32,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 19:47:32,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 19:47:32,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 19:47:32,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 19:47:32,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 19:47:32,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 19:47:32,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 19:47:32,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 19:47:32,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 19:47:32,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 19:47:32,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 19:47:32,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 19:47:32,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 19:47:32,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 19:47:32,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 19:47:32,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 19:47:32,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 19:47:32,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 19:47:32,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 19:47:32,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 19:47:32,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 19:47:32,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 19:47:32,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 19:47:32,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 19:47:32,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 19:47:32,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 19:47:32,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 19:47:32,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 19:47:32,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 19:47:32,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 19:47:32,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 19:47:32,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 19:47:32,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 19:47:32,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 19:47:32,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 19:47:32,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 19:47:32,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 19:47:32,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 19:47:32,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 19:47:32,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 19:47:32,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 19:47:32,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 19:47:32,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 19:47:32,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 19:47:32,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 19:47:32,666 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 19:47:32,666 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 19:47:32,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 19:47:32,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:47:32,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 19:47:32,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 19:47:32,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 19:47:32,667 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 19:47:32,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 19:47:32,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 19:47:32,668 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_820bff1d-6948-4450-98ea-542482e72404/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_820bff1d-6948-4450-98ea-542482e72404/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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2022-12-14 19:47:32,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 19:47:32,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 19:47:32,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 19:47:32,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 19:47:32,894 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 19:47:32,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-12-14 19:47:35,491 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 19:47:35,660 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 19:47:35,660 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-12-14 19:47:35,669 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/data/a83e5081f/b7abb94438f5429cade03814fd279ddc/FLAG4bf28b988 [2022-12-14 19:47:35,683 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/data/a83e5081f/b7abb94438f5429cade03814fd279ddc [2022-12-14 19:47:35,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 19:47:35,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 19:47:35,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 19:47:35,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 19:47:35,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 19:47:35,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12934859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35, skipping insertion in model container [2022-12-14 19:47:35,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 19:47:35,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 19:47:35,893 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_820bff1d-6948-4450-98ea-542482e72404/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2022-12-14 19:47:35,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:47:35,903 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 19:47:35,938 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_820bff1d-6948-4450-98ea-542482e72404/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2022-12-14 19:47:35,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 19:47:35,949 INFO L208 MainTranslator]: Completed translation [2022-12-14 19:47:35,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35 WrapperNode [2022-12-14 19:47:35,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 19:47:35,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 19:47:35,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 19:47:35,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 19:47:35,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,983 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 405 [2022-12-14 19:47:35,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 19:47:35,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 19:47:35,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 19:47:35,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 19:47:35,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:35,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:36,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:36,004 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:36,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:36,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 19:47:36,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 19:47:36,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 19:47:36,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 19:47:36,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:47:35" (1/1) ... [2022-12-14 19:47:36,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 19:47:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 19:47:36,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 19:47:36,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 19:47:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 19:47:36,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 19:47:36,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 19:47:36,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 19:47:36,129 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 19:47:36,131 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 19:47:36,494 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 19:47:36,849 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 19:47:36,850 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 19:47:36,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:47:36 BoogieIcfgContainer [2022-12-14 19:47:36,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 19:47:36,853 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 19:47:36,853 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 19:47:36,863 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 19:47:36,863 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:47:36" (1/1) ... [2022-12-14 19:47:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 19:47:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 19:47:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 19:47:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 19:47:36,913 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:37,824 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 19:47:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2022-12-14 19:47:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2022-12-14 19:47:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 19:47:37,912 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:38,372 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 19:47:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2022-12-14 19:47:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2022-12-14 19:47:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 19:47:38,576 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:39,009 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 19:47:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2022-12-14 19:47:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2022-12-14 19:47:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 19:47:39,328 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:39,825 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 19:47:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2022-12-14 19:47:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2022-12-14 19:47:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 19:47:40,260 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:40,774 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 19:47:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2022-12-14 19:47:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2022-12-14 19:47:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 19:47:41,415 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:41,835 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 19:47:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2022-12-14 19:47:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2022-12-14 19:47:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 19:47:42,606 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:42,671 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 19:47:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2022-12-14 19:47:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2022-12-14 19:47:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 19:47:42,794 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:42,842 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 19:47:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2022-12-14 19:47:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2022-12-14 19:47:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 19:47:42,853 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:43,443 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 19:47:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2022-12-14 19:47:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2022-12-14 19:47:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 19:47:44,709 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:44,914 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 19:47:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2022-12-14 19:47:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2022-12-14 19:47:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 19:47:45,106 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:46,425 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 19:47:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 77 states and 144 transitions. [2022-12-14 19:47:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2022-12-14 19:47:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 19:47:49,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:50,888 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 19:47:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:47:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 94 states and 182 transitions. [2022-12-14 19:47:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 182 transitions. [2022-12-14 19:47:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 19:47:55,847 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:47:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:47:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:47:57,046 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 19:48:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 110 states and 213 transitions. [2022-12-14 19:48:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 213 transitions. [2022-12-14 19:48:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 19:48:02,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:03,632 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 19:48:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 123 states and 235 transitions. [2022-12-14 19:48:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 235 transitions. [2022-12-14 19:48:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 19:48:07,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:09,231 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 19:48:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 142 states and 274 transitions. [2022-12-14 19:48:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 274 transitions. [2022-12-14 19:48:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 19:48:16,151 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:17,612 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 19:48:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 161 states and 313 transitions. [2022-12-14 19:48:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 313 transitions. [2022-12-14 19:48:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 19:48:24,696 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:26,269 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 19:48:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 177 states and 338 transitions. [2022-12-14 19:48:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 338 transitions. [2022-12-14 19:48:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 19:48:31,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:32,504 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 19:48:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 182 states and 350 transitions. [2022-12-14 19:48:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 350 transitions. [2022-12-14 19:48:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 19:48:34,960 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:35,805 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 19:48:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 183 states and 351 transitions. [2022-12-14 19:48:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 351 transitions. [2022-12-14 19:48:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 19:48:36,613 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:37,527 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 19:48:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 186 states and 358 transitions. [2022-12-14 19:48:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 358 transitions. [2022-12-14 19:48:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 19:48:38,816 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:40,182 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 19:48:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 189 states and 365 transitions. [2022-12-14 19:48:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 365 transitions. [2022-12-14 19:48:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 19:48:43,298 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:44,754 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 19:48:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 192 states and 377 transitions. [2022-12-14 19:48:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 377 transitions. [2022-12-14 19:48:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 19:48:46,701 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:48,125 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 19:48:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 197 states and 390 transitions. [2022-12-14 19:48:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 390 transitions. [2022-12-14 19:48:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 19:48:50,664 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:52,344 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 19:48:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:48:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 198 states and 391 transitions. [2022-12-14 19:48:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 391 transitions. [2022-12-14 19:48:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 19:48:53,647 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:48:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:48:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:48:55,287 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 19:49:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:49:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 211 states and 429 transitions. [2022-12-14 19:49:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 429 transitions. [2022-12-14 19:49:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 19:49:01,788 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:49:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:49:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:49:04,213 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 19:49:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:49:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 225 states and 484 transitions. [2022-12-14 19:49:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 484 transitions. [2022-12-14 19:49:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 19:49:13,687 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:49:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:49:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:49:14,806 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 19:49:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:49:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 228 states and 493 transitions. [2022-12-14 19:49:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 493 transitions. [2022-12-14 19:49:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 19:49:16,323 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:49:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:49:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:49:18,347 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 19:49:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:49:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 253 states and 560 transitions. [2022-12-14 19:49:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 560 transitions. [2022-12-14 19:49:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 19:49:30,675 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:49:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:49:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:49:32,665 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 19:49:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:49:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 267 states and 619 transitions. [2022-12-14 19:49:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 619 transitions. [2022-12-14 19:49:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 19:49:43,195 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:49:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:49:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:49:44,402 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 19:49:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:49:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 269 states and 623 transitions. [2022-12-14 19:49:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 623 transitions. [2022-12-14 19:49:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 19:49:45,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:49:45,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:49:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:49:47,562 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 19:49:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:49:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 280 states and 648 transitions. [2022-12-14 19:49:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 648 transitions. [2022-12-14 19:49:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 19:49:54,793 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:49:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:49:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:49:56,179 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 19:50:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 291 states and 667 transitions. [2022-12-14 19:50:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 667 transitions. [2022-12-14 19:50:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 19:50:03,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:04,530 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 19:50:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 291 states and 665 transitions. [2022-12-14 19:50:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 665 transitions. [2022-12-14 19:50:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 19:50:05,204 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:05,913 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 19:50:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 293 states and 670 transitions. [2022-12-14 19:50:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 670 transitions. [2022-12-14 19:50:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 19:50:07,515 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:08,518 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 19:50:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 294 states and 671 transitions. [2022-12-14 19:50:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 671 transitions. [2022-12-14 19:50:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 19:50:09,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:11,377 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 19:50:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 296 states and 678 transitions. [2022-12-14 19:50:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 678 transitions. [2022-12-14 19:50:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 19:50:13,400 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:14,979 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 19:50:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 309 states and 711 transitions. [2022-12-14 19:50:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 711 transitions. [2022-12-14 19:50:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 19:50:22,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:22,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:23,684 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 19:50:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 311 states and 722 transitions. [2022-12-14 19:50:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 722 transitions. [2022-12-14 19:50:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 19:50:25,890 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:26,620 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 19:50:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 314 states and 726 transitions. [2022-12-14 19:50:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 726 transitions. [2022-12-14 19:50:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 19:50:27,965 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:28,824 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 19:50:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 315 states and 727 transitions. [2022-12-14 19:50:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 727 transitions. [2022-12-14 19:50:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 19:50:30,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:31,174 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 19:50:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 316 states and 728 transitions. [2022-12-14 19:50:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 728 transitions. [2022-12-14 19:50:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 19:50:32,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:32,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:32,758 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 19:50:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 315 states and 724 transitions. [2022-12-14 19:50:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 724 transitions. [2022-12-14 19:50:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 19:50:33,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:35,580 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 19:50:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 324 states and 747 transitions. [2022-12-14 19:50:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 747 transitions. [2022-12-14 19:50:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 19:50:43,368 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:44,159 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 19:50:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 328 states and 762 transitions. [2022-12-14 19:50:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 762 transitions. [2022-12-14 19:50:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 19:50:47,381 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:48,051 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 19:50:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 331 states and 777 transitions. [2022-12-14 19:50:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 777 transitions. [2022-12-14 19:50:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 19:50:51,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:51,820 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 19:50:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 331 states and 776 transitions. [2022-12-14 19:50:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 776 transitions. [2022-12-14 19:50:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 19:50:52,781 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:53,478 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 19:50:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:50:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 331 states and 775 transitions. [2022-12-14 19:50:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 775 transitions. [2022-12-14 19:50:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 19:50:54,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:50:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:50:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:50:56,544 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 19:51:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 336 states and 793 transitions. [2022-12-14 19:51:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 793 transitions. [2022-12-14 19:51:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 19:51:01,161 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:03,284 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 19:51:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 342 states and 811 transitions. [2022-12-14 19:51:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 811 transitions. [2022-12-14 19:51:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 19:51:10,488 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:13,373 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 19:51:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 357 states and 835 transitions. [2022-12-14 19:51:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 835 transitions. [2022-12-14 19:51:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 19:51:21,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:22,571 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 19:51:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 361 states and 853 transitions. [2022-12-14 19:51:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 853 transitions. [2022-12-14 19:51:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 19:51:26,539 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:27,536 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 19:51:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 364 states and 867 transitions. [2022-12-14 19:51:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 867 transitions. [2022-12-14 19:51:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 19:51:30,141 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:31,188 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 19:51:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 370 states and 888 transitions. [2022-12-14 19:51:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 888 transitions. [2022-12-14 19:51:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 19:51:36,395 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:37,112 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 19:51:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 371 states and 889 transitions. [2022-12-14 19:51:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 889 transitions. [2022-12-14 19:51:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 19:51:38,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:39,013 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 19:51:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 372 states and 890 transitions. [2022-12-14 19:51:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 890 transitions. [2022-12-14 19:51:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 19:51:39,846 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:42,537 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 19:51:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 373 states and 896 transitions. [2022-12-14 19:51:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 896 transitions. [2022-12-14 19:51:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 19:51:45,391 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:46,168 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 19:51:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 376 states and 908 transitions. [2022-12-14 19:51:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 908 transitions. [2022-12-14 19:51:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 19:51:48,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:48,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:50,613 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 19:51:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 378 states and 915 transitions. [2022-12-14 19:51:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 915 transitions. [2022-12-14 19:51:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 19:51:53,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:51:55,353 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 19:51:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:51:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 382 states and 930 transitions. [2022-12-14 19:51:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 930 transitions. [2022-12-14 19:51:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 19:51:59,214 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:51:59,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:51:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:52:00,194 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 19:52:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:52:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 383 states and 932 transitions. [2022-12-14 19:52:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 932 transitions. [2022-12-14 19:52:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 19:52:01,419 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:52:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:52:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:52:02,566 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 19:52:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:52:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 384 states and 933 transitions. [2022-12-14 19:52:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 933 transitions. [2022-12-14 19:52:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 19:52:03,156 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:52:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:52:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 19:52:06,135 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 19:52:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 19:52:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 387 states and 945 transitions. [2022-12-14 19:52:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 945 transitions. [2022-12-14 19:52:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 19:52:10,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 19:52:10,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 19:52:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:52:11,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:52:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:52:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:52:11,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 19:52:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 19:52:11,901 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 63 iterations. [2022-12-14 19:52:12,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 07:52:12 ImpRootNode [2022-12-14 19:52:12,025 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 19:52:12,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 19:52:12,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 19:52:12,025 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 19:52:12,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:47:36" (3/4) ... [2022-12-14 19:52:12,027 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 19:52:12,130 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 19:52:12,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 19:52:12,131 INFO L158 Benchmark]: Toolchain (without parser) took 276444.88ms. Allocated memory was 134.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 98.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 311.3MB. Max. memory is 16.1GB. [2022-12-14 19:52:12,131 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 19:52:12,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.79ms. Allocated memory is still 134.2MB. Free memory was 97.7MB in the beginning and 81.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 19:52:12,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.44ms. Allocated memory is still 134.2MB. Free memory was 81.9MB in the beginning and 79.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 19:52:12,132 INFO L158 Benchmark]: Boogie Preprocessor took 23.67ms. Allocated memory is still 134.2MB. Free memory was 79.0MB in the beginning and 76.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 19:52:12,132 INFO L158 Benchmark]: RCFGBuilder took 844.39ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 76.6MB in the beginning and 84.6MB in the end (delta: -7.9MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-12-14 19:52:12,132 INFO L158 Benchmark]: CodeCheck took 275171.73ms. Allocated memory was 161.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 83.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 253.3MB. Max. memory is 16.1GB. [2022-12-14 19:52:12,132 INFO L158 Benchmark]: Witness Printer took 104.99ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 19:52:12,134 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: 275.0s, OverallIterations: 63, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35498 SdHoareTripleChecker+Valid, 216.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33451 mSDsluCounter, 11639 SdHoareTripleChecker+Invalid, 192.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10623 mSDsCounter, 9266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97088 IncrementalHoareTripleChecker+Invalid, 106354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9266 mSolverCounterUnsat, 1016 mSDtfsCounter, 97088 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22010 GetRequests, 19974 SyntacticMatches, 718 SemanticMatches, 1318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037985 ImplicationChecksByTransitivity, 214.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 66.9s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1812 ConstructedInterpolants, 0 QuantifiedInterpolants, 19642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 10 PerfectInterpolantSequences, 223/1198 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: 531]: 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 ; [L452] int c1 ; [L453] int i2 ; [L456] c1 = 0 [L457] ep12 = __VERIFIER_nondet_bool() [L458] ep13 = __VERIFIER_nondet_bool() [L459] ep21 = __VERIFIER_nondet_bool() [L460] ep23 = __VERIFIER_nondet_bool() [L461] ep31 = __VERIFIER_nondet_bool() [L462] ep32 = __VERIFIER_nondet_bool() [L463] id1 = __VERIFIER_nondet_char() [L464] r1 = __VERIFIER_nondet_char() [L465] st1 = __VERIFIER_nondet_char() [L466] nl1 = __VERIFIER_nondet_char() [L467] m1 = __VERIFIER_nondet_char() [L468] max1 = __VERIFIER_nondet_char() [L469] mode1 = __VERIFIER_nondet_bool() [L470] id2 = __VERIFIER_nondet_char() [L471] r2 = __VERIFIER_nondet_char() [L472] st2 = __VERIFIER_nondet_char() [L473] nl2 = __VERIFIER_nondet_char() [L474] m2 = __VERIFIER_nondet_char() [L475] max2 = __VERIFIER_nondet_char() [L476] mode2 = __VERIFIER_nondet_bool() [L477] id3 = __VERIFIER_nondet_char() [L478] r3 = __VERIFIER_nondet_char() [L479] st3 = __VERIFIER_nondet_char() [L480] nl3 = __VERIFIER_nondet_char() [L481] m3 = __VERIFIER_nondet_char() [L482] max3 = __VERIFIER_nondet_char() [L483] mode3 = __VERIFIER_nondet_bool() [L484] 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 FALSE !(\read(r131)) [L244] COND TRUE \read(r121) [L245] COND TRUE \read(ep23) [L246] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND FALSE !(\read(ep31)) [L261] tmp___1 = 0 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND TRUE \read(r321) [L284] COND FALSE !(\read(ep21)) [L287] tmp___3 = 0 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE (int )max1 == (int )id1 [L316] COND TRUE (int )max2 == (int )id2 [L317] COND TRUE (int )max3 == (int )id3 [L318] COND TRUE (int )st1 == 0 [L319] COND TRUE (int )st2 == 0 [L320] COND TRUE (int )st3 == 0 [L321] COND TRUE (int )nl1 == 0 [L322] COND TRUE (int )nl2 == 0 [L323] COND TRUE (int )nl3 == 0 [L324] COND TRUE (int )mode1 == 0 [L325] COND TRUE (int )mode2 == 0 [L326] COND TRUE (int )mode3 == 0 [L327] tmp___5 = 1 [L391] return (tmp___5); [L484] RET, EXPR init() [L484] i2 = init() [L485] COND FALSE !(!(i2)) [L486] p12_old = nomsg [L487] p12_new = nomsg [L488] p13_old = nomsg [L489] p13_new = nomsg [L490] p21_old = nomsg [L491] p21_new = nomsg [L492] p23_old = nomsg [L493] p23_new = nomsg [L494] p31_old = nomsg [L495] p31_new = nomsg [L496] p32_old = nomsg [L497] p32_new = nomsg [L498] i2 = 0 VAL [c1=0, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, i2=0, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] 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 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [c1=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, i2=1, id1=1, id2=0, id3=2, m1=0, m2=0, m3=-1, max1=1, max2=0, max3=2, 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=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] 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 TRUE (int )m2 > (int )max2 [L124] max2 = m2 [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND TRUE (int )m2 > (int )max2 [L131] max2 = m2 [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [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 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L517] RET assert(c1) [L518] i2 ++ VAL [c1=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, i2=2, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] 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 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [c1=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, i2=3, id1=1, id2=0, id3=2, m1=0, m2=2, m3=0, max1=1, max2=2, max3=2, 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=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND TRUE (int )max1 == (int )id1 [L93] st1 = (char)1 [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] 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 TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND FALSE !((int )max2 == (int )id2) [L138] nl2 = (char)1 [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [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 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L399] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L445] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L531] reach_error() VAL [\old(arg)=0, arg=0, ep12=1, ep13=0, ep21=0, ep23=255, ep31=0, ep32=255, id1=1, id2=0, id3=2, m1=0, m2=2, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.79ms. Allocated memory is still 134.2MB. Free memory was 97.7MB in the beginning and 81.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.44ms. Allocated memory is still 134.2MB. Free memory was 81.9MB in the beginning and 79.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.67ms. Allocated memory is still 134.2MB. Free memory was 79.0MB in the beginning and 76.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 844.39ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 76.6MB in the beginning and 84.6MB in the end (delta: -7.9MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * CodeCheck took 275171.73ms. Allocated memory was 161.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 83.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 253.3MB. Max. memory is 16.1GB. * Witness Printer took 104.99ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 19:52:12,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_820bff1d-6948-4450-98ea-542482e72404/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