./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 22:14:50,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 22:14:50,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 22:14:50,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 22:14:50,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 22:14:50,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 22:14:50,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 22:14:50,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 22:14:50,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 22:14:50,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 22:14:50,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 22:14:50,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 22:14:50,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 22:14:50,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 22:14:50,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 22:14:50,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 22:14:50,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 22:14:50,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 22:14:50,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 22:14:50,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 22:14:50,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 22:14:50,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 22:14:50,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 22:14:50,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 22:14:50,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 22:14:50,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 22:14:50,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 22:14:50,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 22:14:50,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 22:14:50,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 22:14:50,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 22:14:50,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 22:14:50,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 22:14:50,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 22:14:50,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 22:14:50,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 22:14:50,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 22:14:50,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 22:14:50,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 22:14:50,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 22:14:50,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 22:14:50,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 22:14:50,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 22:14:50,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 22:14:50,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 22:14:50,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 22:14:50,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 22:14:50,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 22:14:50,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 22:14:50,908 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 22:14:50,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 22:14:50,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 22:14:50,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 22:14:50,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 22:14:50,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 22:14:50,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 22:14:50,909 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 22:14:50,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 22:14:50,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 22:14:50,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 22:14:50,910 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 22:14:50,910 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 22:14:50,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 22:14:50,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 22:14:50,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 22:14:50,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 22:14:50,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 22:14:50,911 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 22:14:50,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 22:14:50,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 22:14:50,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2022-12-14 22:14:51,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 22:14:51,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 22:14:51,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 22:14:51,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 22:14:51,104 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 22:14:51,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-12-14 22:14:53,624 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 22:14:53,803 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 22:14:53,803 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-12-14 22:14:53,813 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/data/2419a23d5/b29ebc505c5c4509a36472639b813829/FLAGca65bbd22 [2022-12-14 22:14:54,196 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/data/2419a23d5/b29ebc505c5c4509a36472639b813829 [2022-12-14 22:14:54,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 22:14:54,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 22:14:54,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 22:14:54,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 22:14:54,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 22:14:54,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abebed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54, skipping insertion in model container [2022-12-14 22:14:54,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 22:14:54,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 22:14:54,375 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2022-12-14 22:14:54,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 22:14:54,386 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 22:14:54,433 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2022-12-14 22:14:54,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 22:14:54,448 INFO L208 MainTranslator]: Completed translation [2022-12-14 22:14:54,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54 WrapperNode [2022-12-14 22:14:54,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 22:14:54,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 22:14:54,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 22:14:54,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 22:14:54,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,493 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 407 [2022-12-14 22:14:54,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 22:14:54,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 22:14:54,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 22:14:54,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 22:14:54,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,523 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 22:14:54,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 22:14:54,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 22:14:54,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 22:14:54,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:14:54" (1/1) ... [2022-12-14 22:14:54,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 22:14:54,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 22:14:54,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 22:14:54,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 22:14:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 22:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 22:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 22:14:54,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 22:14:54,674 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 22:14:54,676 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 22:14:55,092 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 22:14:55,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 22:14:55,474 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 22:14:55,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:14:55 BoogieIcfgContainer [2022-12-14 22:14:55,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 22:14:55,476 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 22:14:55,476 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 22:14:55,483 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 22:14:55,483 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:14:55" (1/1) ... [2022-12-14 22:14:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 22:14:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:14:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 22:14:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 22:14:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 22:14:55,529 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:14:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:14:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:14:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:14:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:14:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2022-12-14 22:14:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2022-12-14 22:14:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 22:14:56,573 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:14:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:14:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:14:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:14:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:14:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2022-12-14 22:14:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2022-12-14 22:14:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 22:14:57,304 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:14:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:14:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:14:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:14:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:14:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2022-12-14 22:14:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2022-12-14 22:14:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 22:14:58,229 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:14:58,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:14:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:14:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:14:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:14:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2022-12-14 22:14:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2022-12-14 22:14:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 22:14:59,334 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:14:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:14:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2022-12-14 22:15:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2022-12-14 22:15:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 22:15:00,658 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2022-12-14 22:15:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2022-12-14 22:15:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 22:15:01,856 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2022-12-14 22:15:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2022-12-14 22:15:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:15:02,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2022-12-14 22:15:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2022-12-14 22:15:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:15:02,125 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 57 states and 96 transitions. [2022-12-14 22:15:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 96 transitions. [2022-12-14 22:15:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 22:15:03,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 60 states and 101 transitions. [2022-12-14 22:15:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2022-12-14 22:15:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 22:15:04,233 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 76 states and 132 transitions. [2022-12-14 22:15:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2022-12-14 22:15:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 22:15:08,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 89 states and 155 transitions. [2022-12-14 22:15:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 155 transitions. [2022-12-14 22:15:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 22:15:12,190 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 90 states and 158 transitions. [2022-12-14 22:15:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 158 transitions. [2022-12-14 22:15:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:15:13,044 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 108 states and 191 transitions. [2022-12-14 22:15:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 191 transitions. [2022-12-14 22:15:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:15:17,966 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:17,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 110 states and 197 transitions. [2022-12-14 22:15:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 197 transitions. [2022-12-14 22:15:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 22:15:19,157 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 129 states and 232 transitions. [2022-12-14 22:15:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 232 transitions. [2022-12-14 22:15:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 22:15:24,811 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 130 states and 233 transitions. [2022-12-14 22:15:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 233 transitions. [2022-12-14 22:15:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 22:15:25,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 147 states and 262 transitions. [2022-12-14 22:15:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 262 transitions. [2022-12-14 22:15:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 22:15:32,683 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 149 states and 272 transitions. [2022-12-14 22:15:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 272 transitions. [2022-12-14 22:15:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 22:15:35,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 163 states and 291 transitions. [2022-12-14 22:15:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 291 transitions. [2022-12-14 22:15:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 22:15:40,445 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 164 states and 292 transitions. [2022-12-14 22:15:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 292 transitions. [2022-12-14 22:15:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 22:15:42,517 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 169 states and 302 transitions. [2022-12-14 22:15:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 302 transitions. [2022-12-14 22:15:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 22:15:45,223 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 171 states and 308 transitions. [2022-12-14 22:15:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 308 transitions. [2022-12-14 22:15:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 22:15:47,603 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 175 states and 340 transitions. [2022-12-14 22:15:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 340 transitions. [2022-12-14 22:15:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 22:15:50,904 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:50,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 177 states and 343 transitions. [2022-12-14 22:15:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 343 transitions. [2022-12-14 22:15:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 22:15:52,525 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:15:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:15:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:15:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 185 states and 366 transitions. [2022-12-14 22:15:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 366 transitions. [2022-12-14 22:15:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 22:15:58,829 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:15:58,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:15:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 188 states and 378 transitions. [2022-12-14 22:16:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 378 transitions. [2022-12-14 22:16:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 22:16:01,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 190 states and 382 transitions. [2022-12-14 22:16:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 382 transitions. [2022-12-14 22:16:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 22:16:04,665 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:04,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 191 states and 383 transitions. [2022-12-14 22:16:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 383 transitions. [2022-12-14 22:16:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:16:06,301 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 204 states and 419 transitions. [2022-12-14 22:16:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 419 transitions. [2022-12-14 22:16:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:16:14,508 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 230 states and 502 transitions. [2022-12-14 22:16:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 502 transitions. [2022-12-14 22:16:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:16:28,061 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 232 states and 507 transitions. [2022-12-14 22:16:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 507 transitions. [2022-12-14 22:16:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:16:30,848 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 236 states and 518 transitions. [2022-12-14 22:16:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 518 transitions. [2022-12-14 22:16:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:16:34,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 237 states and 521 transitions. [2022-12-14 22:16:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 521 transitions. [2022-12-14 22:16:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:16:36,720 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 238 states and 524 transitions. [2022-12-14 22:16:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 524 transitions. [2022-12-14 22:16:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 22:16:38,650 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 249 states and 551 transitions. [2022-12-14 22:16:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 551 transitions. [2022-12-14 22:16:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 22:16:47,289 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 260 states and 571 transitions. [2022-12-14 22:16:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 571 transitions. [2022-12-14 22:16:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 22:16:56,796 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:16:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:16:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 260 states and 569 transitions. [2022-12-14 22:16:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 569 transitions. [2022-12-14 22:16:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 22:16:58,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:16:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:16:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:16:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 271 states and 602 transitions. [2022-12-14 22:17:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 602 transitions. [2022-12-14 22:17:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 22:17:06,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 271 states and 599 transitions. [2022-12-14 22:17:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 599 transitions. [2022-12-14 22:17:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:09,242 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 281 states and 623 transitions. [2022-12-14 22:17:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 623 transitions. [2022-12-14 22:17:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:18,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 291 states and 641 transitions. [2022-12-14 22:17:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 641 transitions. [2022-12-14 22:17:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:28,312 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 292 states and 643 transitions. [2022-12-14 22:17:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 643 transitions. [2022-12-14 22:17:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:29,900 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 293 states and 645 transitions. [2022-12-14 22:17:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 645 transitions. [2022-12-14 22:17:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:31,374 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 293 states and 643 transitions. [2022-12-14 22:17:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 643 transitions. [2022-12-14 22:17:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:33,237 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 292 states and 640 transitions. [2022-12-14 22:17:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 640 transitions. [2022-12-14 22:17:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:35,042 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 302 states and 668 transitions. [2022-12-14 22:17:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 668 transitions. [2022-12-14 22:17:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:17:42,852 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 312 states and 694 transitions. [2022-12-14 22:17:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 694 transitions. [2022-12-14 22:17:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:17:48,818 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:17:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:17:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:17:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:17:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 323 states and 721 transitions. [2022-12-14 22:17:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 721 transitions. [2022-12-14 22:17:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:17:59,856 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:17:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 326 states and 727 transitions. [2022-12-14 22:18:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 727 transitions. [2022-12-14 22:18:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:18:03,710 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 329 states and 740 transitions. [2022-12-14 22:18:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 740 transitions. [2022-12-14 22:18:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:18:07,252 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 330 states and 745 transitions. [2022-12-14 22:18:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 745 transitions. [2022-12-14 22:18:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:18:09,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 333 states and 756 transitions. [2022-12-14 22:18:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 756 transitions. [2022-12-14 22:18:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:18:18,390 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 339 states and 778 transitions. [2022-12-14 22:18:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 778 transitions. [2022-12-14 22:18:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:18:31,500 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 340 states and 779 transitions. [2022-12-14 22:18:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 779 transitions. [2022-12-14 22:18:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:18:36,199 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 343 states and 792 transitions. [2022-12-14 22:18:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 792 transitions. [2022-12-14 22:18:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:18:40,687 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 358 states and 840 transitions. [2022-12-14 22:18:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 840 transitions. [2022-12-14 22:18:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:18:57,035 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:18:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:18:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:18:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 359 states and 845 transitions. [2022-12-14 22:18:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 845 transitions. [2022-12-14 22:18:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:18:59,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:18:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:18:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 361 states and 847 transitions. [2022-12-14 22:19:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 847 transitions. [2022-12-14 22:19:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:19:02,982 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 363 states and 850 transitions. [2022-12-14 22:19:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 850 transitions. [2022-12-14 22:19:07,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:19:07,790 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 365 states and 875 transitions. [2022-12-14 22:19:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 875 transitions. [2022-12-14 22:19:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:19:10,286 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 368 states and 886 transitions. [2022-12-14 22:19:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 886 transitions. [2022-12-14 22:19:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 22:19:14,031 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 374 states and 908 transitions. [2022-12-14 22:19:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 908 transitions. [2022-12-14 22:19:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 22:19:26,632 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 375 states and 910 transitions. [2022-12-14 22:19:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 910 transitions. [2022-12-14 22:19:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 22:19:29,968 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 376 states and 911 transitions. [2022-12-14 22:19:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 911 transitions. [2022-12-14 22:19:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 22:19:32,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 378 states and 922 transitions. [2022-12-14 22:19:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 922 transitions. [2022-12-14 22:19:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 22:19:35,395 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:35,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:19:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:19:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:19:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 381 states and 936 transitions. [2022-12-14 22:19:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 936 transitions. [2022-12-14 22:19:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 22:19:44,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:19:44,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:19:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 22:19:45,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 22:19:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 22:19:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 22:19:45,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 22:19:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 22:19:46,150 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 68 iterations. [2022-12-14 22:19:46,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 10:19:46 ImpRootNode [2022-12-14 22:19:46,238 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 22:19:46,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 22:19:46,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 22:19:46,239 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 22:19:46,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:14:55" (3/4) ... [2022-12-14 22:19:46,241 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 22:19:46,363 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 22:19:46,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 22:19:46,363 INFO L158 Benchmark]: Toolchain (without parser) took 292164.05ms. Allocated memory was 115.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 80.6MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 293.5MB. Max. memory is 16.1GB. [2022-12-14 22:19:46,363 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 22:19:46,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.79ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 64.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 22:19:46,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.05ms. Allocated memory is still 115.3MB. Free memory was 64.5MB in the beginning and 61.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 22:19:46,364 INFO L158 Benchmark]: Boogie Preprocessor took 34.07ms. Allocated memory is still 115.3MB. Free memory was 61.6MB in the beginning and 59.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 22:19:46,364 INFO L158 Benchmark]: RCFGBuilder took 946.52ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 59.3MB in the beginning and 102.5MB in the end (delta: -43.2MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2022-12-14 22:19:46,365 INFO L158 Benchmark]: CodeCheck took 290762.24ms. Allocated memory was 140.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 102.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 273.7MB. Max. memory is 16.1GB. [2022-12-14 22:19:46,365 INFO L158 Benchmark]: Witness Printer took 123.85ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 22:19:46,367 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 290.7s, OverallIterations: 68, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37973 SdHoareTripleChecker+Valid, 234.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35673 mSDsluCounter, 9886 SdHoareTripleChecker+Invalid, 210.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8785 mSDsCounter, 9205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99773 IncrementalHoareTripleChecker+Invalid, 108978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9205 mSolverCounterUnsat, 1101 mSDtfsCounter, 99773 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22529 GetRequests, 20421 SyntacticMatches, 808 SemanticMatches, 1300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998760 ImplicationChecksByTransitivity, 217.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 76.5s InterpolantComputationTime, 2044 NumberOfCodeBlocks, 2044 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1929 ConstructedInterpolants, 0 QuantifiedInterpolants, 21916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 10 PerfectInterpolantSequences, 240/1238 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: 543]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L465] int c1 ; [L466] int i2 ; [L469] c1 = 0 [L470] ep12 = __VERIFIER_nondet_bool() [L471] ep13 = __VERIFIER_nondet_bool() [L472] ep21 = __VERIFIER_nondet_bool() [L473] ep23 = __VERIFIER_nondet_bool() [L474] ep31 = __VERIFIER_nondet_bool() [L475] ep32 = __VERIFIER_nondet_bool() [L476] id1 = __VERIFIER_nondet_char() [L477] r1 = __VERIFIER_nondet_uchar() [L478] st1 = __VERIFIER_nondet_char() [L479] nl1 = __VERIFIER_nondet_char() [L480] m1 = __VERIFIER_nondet_char() [L481] max1 = __VERIFIER_nondet_char() [L482] mode1 = __VERIFIER_nondet_bool() [L483] id2 = __VERIFIER_nondet_char() [L484] r2 = __VERIFIER_nondet_uchar() [L485] st2 = __VERIFIER_nondet_char() [L486] nl2 = __VERIFIER_nondet_char() [L487] m2 = __VERIFIER_nondet_char() [L488] max2 = __VERIFIER_nondet_char() [L489] mode2 = __VERIFIER_nondet_bool() [L490] id3 = __VERIFIER_nondet_char() [L491] r3 = __VERIFIER_nondet_uchar() [L492] st3 = __VERIFIER_nondet_char() [L493] nl3 = __VERIFIER_nondet_char() [L494] m3 = __VERIFIER_nondet_char() [L495] max3 = __VERIFIER_nondet_char() [L496] mode3 = __VERIFIER_nondet_bool() [L497] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND FALSE !(\read(r121)) [L244] COND FALSE !(\read(r131)) [L251] tmp = 0 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND FALSE !(\read(r121)) [L264] tmp___0 = 0 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND FALSE !(\read(r231)) [L277] tmp___1 = 0 [L279] r212 = (_Bool )tmp___1 [L280] COND FALSE !(\read(r231)) [L283] COND FALSE !(\read(r211)) [L290] tmp___2 = 0 [L292] r232 = (_Bool )tmp___2 [L293] COND FALSE !(\read(r311)) [L296] COND FALSE !(\read(r321)) [L303] tmp___3 = 0 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND FALSE !(\read(r311)) [L316] tmp___4 = 0 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE (int )max1 == (int )id1 [L329] COND TRUE (int )max2 == (int )id2 [L330] COND TRUE (int )max3 == (int )id3 [L331] COND TRUE (int )st1 == 0 [L332] COND TRUE (int )st2 == 0 [L333] COND TRUE (int )st3 == 0 [L334] COND TRUE (int )nl1 == 0 [L335] COND TRUE (int )nl2 == 0 [L336] COND TRUE (int )nl3 == 0 [L337] COND TRUE (int )mode1 == 0 [L338] COND TRUE (int )mode2 == 0 [L339] COND TRUE (int )mode3 == 0 [L340] tmp___5 = 1 [L404] return (tmp___5); [L497] RET, EXPR init() [L497] i2 = init() [L498] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L498] RET assume_abort_if_not(i2) [L499] p12_old = nomsg [L500] p12_new = nomsg [L501] p13_old = nomsg [L502] p13_new = nomsg [L503] p21_old = nomsg [L504] p21_new = nomsg [L505] p23_old = nomsg [L506] p23_new = nomsg [L507] p31_old = nomsg [L508] p31_new = nomsg [L509] p32_old = nomsg [L510] p32_new = nomsg [L511] i2 = 0 VAL [c1=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, i2=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L412] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L458] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L543] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=0, id3=2, m1=-2, m2=2, m3=-2, max1=1, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.79ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 64.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.05ms. Allocated memory is still 115.3MB. Free memory was 64.5MB in the beginning and 61.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.07ms. Allocated memory is still 115.3MB. Free memory was 61.6MB in the beginning and 59.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 946.52ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 59.3MB in the beginning and 102.5MB in the end (delta: -43.2MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * CodeCheck took 290762.24ms. Allocated memory was 140.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 102.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 273.7MB. Max. memory is 16.1GB. * Witness Printer took 123.85ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 22:19:46,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae723d64-c6ce-4e5d-b383-a1900fca72eb/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE