./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:06:44,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:06:44,844 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:06:44,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:06:44,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:06:44,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:06:44,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:06:44,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:06:44,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:06:44,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:06:44,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:06:44,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:06:44,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:06:44,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:06:44,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:06:44,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:06:44,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:06:44,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:06:44,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:06:44,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:06:44,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:06:44,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:06:44,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:06:44,891 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:06:44,891 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:06:44,891 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:06:44,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:06:44,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:06:44,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:06:44,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:06:44,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:06:44,892 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:06:44,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:06:44,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2024-11-13 21:06:45,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:06:45,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:06:45,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:06:45,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:06:45,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:06:45,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-13 21:06:47,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:06:47,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:06:47,539 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-11-13 21:06:47,549 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/data/eb297ceb7/e8da4a833d724c06ab0a4459bab75668/FLAG96bf30060 [2024-11-13 21:06:47,568 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/data/eb297ceb7/e8da4a833d724c06ab0a4459bab75668 [2024-11-13 21:06:47,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:06:47,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:06:47,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:06:47,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:06:47,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:06:47,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:47,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ef40d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47, skipping insertion in model container [2024-11-13 21:06:47,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:47,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:06:47,839 WARN L250 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_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2024-11-13 21:06:47,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:06:47,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:06:47,917 WARN L250 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_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2024-11-13 21:06:47,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:06:47,936 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:06:47,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47 WrapperNode [2024-11-13 21:06:47,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:06:47,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:06:47,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:06:47,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:06:47,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:47,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,011 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-13 21:06:48,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:06:48,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:06:48,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:06:48,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:06:48,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:06:48,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:06:48,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:06:48,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:06:48,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:06:47" (1/1) ... [2024-11-13 21:06:48,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:06:48,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:06:48,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:06:48,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:06:48,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:06:48,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:06:48,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:06:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:06:48,236 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:06:48,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:06:49,033 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-13 21:06:49,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:06:49,825 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:06:49,826 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:06:49,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:06:49 BoogieIcfgContainer [2024-11-13 21:06:49,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:06:49,827 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:06:49,827 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:06:49,837 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:06:49,837 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:06:49" (1/1) ... [2024-11-13 21:06:49,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:06:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:06:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:06:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:06:49,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-11-13 21:06:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-11-13 21:06:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:06:52,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-11-13 21:06:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-11-13 21:06:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:06:54,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-11-13 21:06:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-11-13 21:06:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:06:55,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-11-13 21:06:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-11-13 21:06:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:06:57,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-11-13 21:06:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-11-13 21:06:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:06:59,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-11-13 21:07:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-11-13 21:07:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:07:01,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-11-13 21:07:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-11-13 21:07:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:07:01,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:01,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2024-11-13 21:07:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2024-11-13 21:07:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:07:01,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2024-11-13 21:07:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2024-11-13 21:07:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:07:04,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2024-11-13 21:07:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2024-11-13 21:07:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:07:04,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 77 states and 144 transitions. [2024-11-13 21:07:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2024-11-13 21:07:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:07:11,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 91 states and 174 transitions. [2024-11-13 21:07:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 174 transitions. [2024-11-13 21:07:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:07:17,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 96 states and 191 transitions. [2024-11-13 21:07:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 191 transitions. [2024-11-13 21:07:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:07:22,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:22,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 114 states and 230 transitions. [2024-11-13 21:07:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 230 transitions. [2024-11-13 21:07:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:07:29,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 116 states and 238 transitions. [2024-11-13 21:07:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 238 transitions. [2024-11-13 21:07:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:07:31,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 117 states and 241 transitions. [2024-11-13 21:07:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 241 transitions. [2024-11-13 21:07:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:07:32,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 131 states and 271 transitions. [2024-11-13 21:07:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 271 transitions. [2024-11-13 21:07:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:07:39,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 132 states and 277 transitions. [2024-11-13 21:07:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 277 transitions. [2024-11-13 21:07:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:07:40,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 133 states and 280 transitions. [2024-11-13 21:07:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 280 transitions. [2024-11-13 21:07:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:07:42,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 134 states and 282 transitions. [2024-11-13 21:07:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 282 transitions. [2024-11-13 21:07:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:07:43,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 135 states and 288 transitions. [2024-11-13 21:07:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 288 transitions. [2024-11-13 21:07:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:07:44,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 150 states and 314 transitions. [2024-11-13 21:07:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 314 transitions. [2024-11-13 21:07:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:07:50,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 169 states and 354 transitions. [2024-11-13 21:07:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 354 transitions. [2024-11-13 21:07:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:07:59,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 187 states and 388 transitions. [2024-11-13 21:08:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 388 transitions. [2024-11-13 21:08:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:08:07,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:07,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 204 states and 417 transitions. [2024-11-13 21:08:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 417 transitions. [2024-11-13 21:08:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:08:15,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 208 states and 427 transitions. [2024-11-13 21:08:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 427 transitions. [2024-11-13 21:08:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:08:19,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 209 states and 428 transitions. [2024-11-13 21:08:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 428 transitions. [2024-11-13 21:08:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:08:22,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 229 states and 469 transitions. [2024-11-13 21:08:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 469 transitions. [2024-11-13 21:08:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:08:31,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 237 states and 491 transitions. [2024-11-13 21:08:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 491 transitions. [2024-11-13 21:08:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:08:39,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 251 states and 549 transitions. [2024-11-13 21:08:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 549 transitions. [2024-11-13 21:08:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:08:53,160 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 256 states and 568 transitions. [2024-11-13 21:09:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 568 transitions. [2024-11-13 21:09:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:09:01,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:01,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 269 states and 599 transitions. [2024-11-13 21:09:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 599 transitions. [2024-11-13 21:09:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:09:16,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:16,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 282 states and 630 transitions. [2024-11-13 21:09:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 630 transitions. [2024-11-13 21:09:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:09:31,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:31,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 285 states and 635 transitions. [2024-11-13 21:09:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 635 transitions. [2024-11-13 21:09:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:09:37,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 294 states and 655 transitions. [2024-11-13 21:09:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 655 transitions. [2024-11-13 21:09:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:09:44,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 305 states and 679 transitions. [2024-11-13 21:09:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 679 transitions. [2024-11-13 21:09:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:09:59,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 315 states and 710 transitions. [2024-11-13 21:10:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 710 transitions. [2024-11-13 21:10:10,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:10:10,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:10,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 330 states and 763 transitions. [2024-11-13 21:10:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 763 transitions. [2024-11-13 21:10:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:10:28,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 331 states and 766 transitions. [2024-11-13 21:10:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 766 transitions. [2024-11-13 21:10:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:10:31,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:10:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:10:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 345 states and 803 transitions. [2024-11-13 21:10:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 803 transitions. [2024-11-13 21:10:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:10:50,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:10:50,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:10:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:10:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 351 states and 817 transitions. [2024-11-13 21:11:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 817 transitions. [2024-11-13 21:11:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:11:02,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:11:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 357 states and 830 transitions. [2024-11-13 21:11:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 830 transitions. [2024-11-13 21:11:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:11:14,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:14,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:11:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 369 states and 864 transitions. [2024-11-13 21:11:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 864 transitions. [2024-11-13 21:11:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:11:32,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:32,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:11:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 379 states and 893 transitions. [2024-11-13 21:11:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 893 transitions. [2024-11-13 21:11:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:11:48,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:11:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 381 states and 906 transitions. [2024-11-13 21:11:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 906 transitions. [2024-11-13 21:11:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:11:52,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:52,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:11:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:11:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:11:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 382 states and 913 transitions. [2024-11-13 21:11:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 913 transitions. [2024-11-13 21:11:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:11:56,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:11:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:11:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 388 states and 932 transitions. [2024-11-13 21:12:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 932 transitions. [2024-11-13 21:12:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:12:10,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:26,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 393 states and 960 transitions. [2024-11-13 21:12:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 960 transitions. [2024-11-13 21:12:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:12:26,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 394 states and 962 transitions. [2024-11-13 21:12:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 962 transitions. [2024-11-13 21:12:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:12:29,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 396 states and 976 transitions. [2024-11-13 21:12:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 976 transitions. [2024-11-13 21:12:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:12:37,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 398 states and 992 transitions. [2024-11-13 21:12:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 992 transitions. [2024-11-13 21:12:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:12:40,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 404 states and 1020 transitions. [2024-11-13 21:12:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1020 transitions. [2024-11-13 21:12:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:12:52,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:12:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:12:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 405 states and 1028 transitions. [2024-11-13 21:12:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1028 transitions. [2024-11-13 21:12:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:12:54,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:12:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:12:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:12:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:13:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:13:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 410 states and 1046 transitions. [2024-11-13 21:13:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1046 transitions. [2024-11-13 21:13:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:13:02,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:13:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:13:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:13:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:13:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:13:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 414 states and 1062 transitions. [2024-11-13 21:13:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1062 transitions. [2024-11-13 21:13:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:13:08,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:13:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:13:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:13:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:13:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:13:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 416 states and 1075 transitions. [2024-11-13 21:13:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1075 transitions. [2024-11-13 21:13:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:13:12,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:13:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:13:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:13:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:13:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:13:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 427 states and 1098 transitions. [2024-11-13 21:13:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1098 transitions. [2024-11-13 21:13:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:13:33,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:13:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:13:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:13:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:13:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:13:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 432 states and 1118 transitions. [2024-11-13 21:13:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1118 transitions. [2024-11-13 21:13:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:13:43,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:13:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:13:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:13:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:14:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:14:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 436 states and 1147 transitions. [2024-11-13 21:14:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1147 transitions. [2024-11-13 21:14:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:14:00,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:14:00,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:14:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:14:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:14:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:14:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 439 states and 1158 transitions. [2024-11-13 21:14:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1158 transitions. [2024-11-13 21:14:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:14:10,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:14:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:14:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:14:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:14:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:14:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 442 states and 1177 transitions. [2024-11-13 21:14:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1177 transitions. [2024-11-13 21:14:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:14:22,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:14:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:14:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:14:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:14:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:14:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 455 states and 1215 transitions. [2024-11-13 21:14:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1215 transitions. [2024-11-13 21:14:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:14:48,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:14:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:14:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:14:49,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:14:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:14:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:14:50,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:14:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:14:50,973 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 63 iterations. [2024-11-13 21:14:51,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:14:51 ImpRootNode [2024-11-13 21:14:51,185 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:14:51,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:14:51,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:14:51,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:14:51,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:06:49" (3/4) ... [2024-11-13 21:14:51,193 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:14:51,386 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:14:51,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:14:51,387 INFO L158 Benchmark]: Toolchain (without parser) took 483814.82ms. Allocated memory was 109.1MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 83.4MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 391.6MB. Max. memory is 16.1GB. [2024-11-13 21:14:51,387 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:14:51,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.09ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 66.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:14:51,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.95ms. Allocated memory is still 109.1MB. Free memory was 66.0MB in the beginning and 63.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:14:51,388 INFO L158 Benchmark]: Boogie Preprocessor took 52.36ms. Allocated memory is still 109.1MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:14:51,388 INFO L158 Benchmark]: RCFGBuilder took 1760.86ms. Allocated memory is still 109.1MB. Free memory was 60.9MB in the beginning and 29.8MB in the end (delta: 31.2MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-13 21:14:51,389 INFO L158 Benchmark]: CodeCheck took 481358.29ms. Allocated memory was 109.1MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 29.8MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-13 21:14:51,389 INFO L158 Benchmark]: Witness Printer took 199.93ms. Allocated memory is still 3.8GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:14:51,391 INFO L338 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: 481.1s, OverallIterations: 63, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34135 SdHoareTripleChecker+Valid, 261.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32085 mSDsluCounter, 11223 SdHoareTripleChecker+Invalid, 236.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10207 mSDsCounter, 11787 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103589 IncrementalHoareTripleChecker+Invalid, 115376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11787 mSolverCounterUnsat, 1016 mSDtfsCounter, 103589 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21480 GetRequests, 19101 SyntacticMatches, 839 SemanticMatches, 1540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460397 ImplicationChecksByTransitivity, 385.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 123.2s InterpolantComputationTime, 1855 NumberOfCodeBlocks, 1855 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1745 ConstructedInterpolants, 0 QuantifiedInterpolants, 18928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 10 PerfectInterpolantSequences, 201/1118 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 573]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] _Bool newmax1 ; [L57] char id2 ; [L58] char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] _Bool newmax2 ; [L65] char id3 ; [L66] char r3 ; [L67] char st3 ; [L68] char nl3 ; [L69] char m3 ; [L70] char max3 ; [L71] _Bool mode3 ; [L72] _Bool newmax3 ; [L491] int c1 ; [L492] int i2 ; [L495] c1 = 0 [L496] ep12 = __VERIFIER_nondet_bool() [L497] ep13 = __VERIFIER_nondet_bool() [L498] ep21 = __VERIFIER_nondet_bool() [L499] ep23 = __VERIFIER_nondet_bool() [L500] ep31 = __VERIFIER_nondet_bool() [L501] ep32 = __VERIFIER_nondet_bool() [L502] id1 = __VERIFIER_nondet_char() [L503] r1 = __VERIFIER_nondet_char() [L504] st1 = __VERIFIER_nondet_char() [L505] nl1 = __VERIFIER_nondet_char() [L506] m1 = __VERIFIER_nondet_char() [L507] max1 = __VERIFIER_nondet_char() [L508] mode1 = __VERIFIER_nondet_bool() [L509] newmax1 = __VERIFIER_nondet_bool() [L510] id2 = __VERIFIER_nondet_char() [L511] r2 = __VERIFIER_nondet_char() [L512] st2 = __VERIFIER_nondet_char() [L513] nl2 = __VERIFIER_nondet_char() [L514] m2 = __VERIFIER_nondet_char() [L515] max2 = __VERIFIER_nondet_char() [L516] mode2 = __VERIFIER_nondet_bool() [L517] newmax2 = __VERIFIER_nondet_bool() [L518] id3 = __VERIFIER_nondet_char() [L519] r3 = __VERIFIER_nondet_char() [L520] st3 = __VERIFIER_nondet_char() [L521] nl3 = __VERIFIER_nondet_char() [L522] m3 = __VERIFIER_nondet_char() [L523] max3 = __VERIFIER_nondet_char() [L524] mode3 = __VERIFIER_nondet_bool() [L525] newmax3 = __VERIFIER_nondet_bool() [L526] CALL, EXPR init() [L228] _Bool r121 ; [L229] _Bool r131 ; [L230] _Bool r211 ; [L231] _Bool r231 ; [L232] _Bool r311 ; [L233] _Bool r321 ; [L234] _Bool r122 ; [L235] int tmp ; [L236] _Bool r132 ; [L237] int tmp___0 ; [L238] _Bool r212 ; [L239] int tmp___1 ; [L240] _Bool r232 ; [L241] int tmp___2 ; [L242] _Bool r312 ; [L243] int tmp___3 ; [L244] _Bool r322 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L249] r121 = ep12 [L250] r131 = ep13 [L251] r211 = ep21 [L252] r231 = ep23 [L253] r311 = ep31 [L254] r321 = ep32 [L255] COND TRUE \read(r121) [L256] tmp = 1 [L267] r122 = (_Bool )tmp [L268] COND FALSE !(\read(r131)) [L271] COND TRUE \read(r121) [L272] COND FALSE !(\read(ep23)) [L275] tmp___0 = 0 [L280] r132 = (_Bool )tmp___0 [L281] COND TRUE \read(r211) [L282] tmp___1 = 1 [L293] r212 = (_Bool )tmp___1 [L294] COND FALSE !(\read(r231)) [L297] COND TRUE \read(r211) [L298] COND FALSE !(\read(ep13)) [L301] tmp___2 = 0 [L306] r232 = (_Bool )tmp___2 [L307] COND FALSE !(\read(r311)) [L310] COND TRUE \read(r321) [L311] COND TRUE \read(ep21) [L312] tmp___3 = 1 [L319] r312 = (_Bool )tmp___3 [L320] COND TRUE \read(r321) [L321] tmp___4 = 1 [L332] r322 = (_Bool )tmp___4 [L333] COND TRUE (int )id1 != (int )id2 [L334] COND TRUE (int )id1 != (int )id3 [L335] COND TRUE (int )id2 != (int )id3 [L336] COND TRUE (int )id1 >= 0 [L337] COND TRUE (int )id2 >= 0 [L338] COND TRUE (int )id3 >= 0 [L339] COND TRUE (int )r1 == 0 [L340] COND TRUE (int )r2 == 0 [L341] COND TRUE (int )r3 == 0 [L342] COND TRUE (int )max1 == (int )id1 [L343] COND TRUE (int )max2 == (int )id2 [L344] COND TRUE (int )max3 == (int )id3 [L345] COND TRUE (int )st1 == 0 [L346] COND TRUE (int )st2 == 0 [L347] COND TRUE (int )st3 == 0 [L348] COND TRUE (int )nl1 == 0 [L349] COND TRUE (int )nl2 == 0 [L350] COND TRUE (int )nl3 == 0 [L351] COND TRUE (int )mode1 == 0 [L352] COND TRUE (int )mode2 == 0 [L353] COND TRUE (int )mode3 == 0 [L354] COND TRUE \read(newmax1) [L355] COND TRUE \read(newmax2) [L356] COND TRUE \read(newmax3) [L357] tmp___5 = 1 [L430] return (tmp___5); [L526] RET, EXPR init() [L526] i2 = init() [L527] COND FALSE !(!(i2)) [L528] p12_old = nomsg [L529] p12_new = nomsg [L530] p13_old = nomsg [L531] p13_new = nomsg [L532] p21_old = nomsg [L533] p21_new = nomsg [L534] p23_old = nomsg [L535] p23_new = nomsg [L536] p31_old = nomsg [L537] p31_new = nomsg [L538] p32_old = nomsg [L539] p32_new = nomsg [L540] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, i2=0, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] COND TRUE \read(newmax1) [L110] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND TRUE \read(ep21) [L160] COND TRUE \read(newmax2) [L161] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L164] COND FALSE !(\read(ep23)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND TRUE \read(ep32) [L216] COND TRUE \read(newmax3) [L217] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L447] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, 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] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, i2=1, id1=0, id2=2, id3=1, m1=3, m2=-1, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND TRUE \read(ep21) [L82] m1 = p21_old [L83] p21_old = nomsg [L84] COND TRUE (int )m1 > (int )max1 [L85] max1 = m1 [L86] newmax = (_Bool)1 [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND TRUE \read(ep12) [L133] m2 = p12_old [L134] p12_old = nomsg [L135] COND FALSE !((int )m2 > (int )max2) [L140] COND TRUE \read(ep32) [L141] m2 = p32_old [L142] p32_old = nomsg [L143] COND FALSE !((int )m2 > (int )max2) [L148] newmax2 = newmax [L149] COND FALSE !((int )r2 == 2) [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND FALSE !(\read(ep23)) [L199] newmax3 = newmax [L200] COND FALSE !((int )r3 == 2) [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, i2=2, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] COND TRUE \read(newmax1) [L110] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND TRUE \read(ep21) [L160] COND FALSE !(\read(newmax2)) [L164] COND FALSE !(\read(ep23)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND TRUE \read(ep32) [L216] COND FALSE !(\read(newmax3)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, i2=3, id1=0, id2=2, id3=1, m1=2, m2=1, m3=2, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND TRUE \read(ep21) [L82] m1 = p21_old [L83] p21_old = nomsg [L84] COND FALSE !((int )m1 > (int )max1) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] nl1 = (char)1 [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND TRUE \read(ep12) [L133] m2 = p12_old [L134] p12_old = nomsg [L135] COND FALSE !((int )m2 > (int )max2) [L140] COND TRUE \read(ep32) [L141] m2 = p32_old [L142] p32_old = nomsg [L143] COND FALSE !((int )m2 > (int )max2) [L148] newmax2 = newmax [L149] COND TRUE (int )r2 == 2 [L150] COND TRUE (int )max2 == (int )id2 [L151] st2 = (char)1 [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND FALSE !(\read(ep23)) [L199] newmax3 = newmax [L200] COND TRUE (int )r3 == 2 [L201] COND TRUE (int )max3 == (int )id3 [L202] st3 = (char)1 [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L438] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L484] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L573] reach_error() VAL [ep12=1, ep13=0, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=2, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.09ms. Allocated memory is still 109.1MB. Free memory was 83.0MB in the beginning and 66.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.95ms. Allocated memory is still 109.1MB. Free memory was 66.0MB in the beginning and 63.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.36ms. Allocated memory is still 109.1MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1760.86ms. Allocated memory is still 109.1MB. Free memory was 60.9MB in the beginning and 29.8MB in the end (delta: 31.2MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * CodeCheck took 481358.29ms. Allocated memory was 109.1MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 29.8MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 199.93ms. Allocated memory is still 3.8GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:14:51,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76eb40c7-3a5b-47bd-8b28-2e7174b8c692/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with 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