./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ --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 c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:41:42,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:41:42,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:41:42,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:41:42,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:41:42,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:41:42,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:41:42,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:41:42,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:41:42,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:41:42,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:41:42,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:41:42,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:41:42,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:41:42,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:41:42,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:41:42,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:41:42,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:41:42,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:41:42,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:41:42,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:41:42,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:41:42,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:41:42,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:41:42,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:41:42,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:41:42,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:41:42,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:41:42,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:41:42,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:41:42,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:41:42,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:41:42,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:41:42,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:41:42,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:41:42,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:41:42,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:41:42,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:41:42,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:41:42,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:41:42,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:41:42,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:41:42,913 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:41:42,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:41:42,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:41:42,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:41:42,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:41:42,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:41:42,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:41:42,917 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:41:42,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:41:42,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:41:42,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:41:42,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:41:42,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:41:42,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:41:42,919 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:41:42,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:41:42,920 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:41:42,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:41:42,920 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:41:42,920 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:41:42,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:41:42,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:41:42,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:41:42,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:41:42,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:41:42,921 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:41:42,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:41:42,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:41:42,922 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_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/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_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ 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 -> c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a [2021-11-23 00:41:43,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:41:43,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:41:43,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:41:43,223 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:41:43,224 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:41:43,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2021-11-23 00:41:43,314 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/data/9ec582dca/100768b578a049a9892acbd70dba7692/FLAG8c3115b5c [2021-11-23 00:41:43,817 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:41:43,818 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2021-11-23 00:41:43,839 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/data/9ec582dca/100768b578a049a9892acbd70dba7692/FLAG8c3115b5c [2021-11-23 00:41:44,121 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/data/9ec582dca/100768b578a049a9892acbd70dba7692 [2021-11-23 00:41:44,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:41:44,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:41:44,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:41:44,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:41:44,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:41:44,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e19c47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44, skipping insertion in model container [2021-11-23 00:41:44,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:41:44,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:41:44,425 WARN L230 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_0762b9c3-ca36-4b54-aedc-d2dc60c79374/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2021-11-23 00:41:44,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:41:44,438 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:41:44,498 WARN L230 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_0762b9c3-ca36-4b54-aedc-d2dc60c79374/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2021-11-23 00:41:44,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:41:44,514 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:41:44,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44 WrapperNode [2021-11-23 00:41:44,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:41:44,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:41:44,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:41:44,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:41:44,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,593 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2021-11-23 00:41:44,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:41:44,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:41:44,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:41:44,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:41:44,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:41:44,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:41:44,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:41:44,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:41:44,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:44" (1/1) ... [2021-11-23 00:41:44,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:41:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:41:44,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:41:44,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:41:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:41:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:41:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:41:44,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:41:44,855 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:41:44,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:41:45,451 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:41:46,069 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:41:46,070 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 00:41:46,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:46 BoogieIcfgContainer [2021-11-23 00:41:46,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:41:46,074 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:41:46,074 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:41:46,085 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:41:46,086 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:46" (1/1) ... [2021-11-23 00:41:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:41:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 00:41:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 00:41:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 00:41:46,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:46,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2021-11-23 00:41:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2021-11-23 00:41:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 00:41:47,095 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:47,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2021-11-23 00:41:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2021-11-23 00:41:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 00:41:47,770 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:47,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2021-11-23 00:41:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2021-11-23 00:41:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 00:41:48,541 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:48,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2021-11-23 00:41:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2021-11-23 00:41:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 00:41:49,488 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:49,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2021-11-23 00:41:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2021-11-23 00:41:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 00:41:50,697 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:50,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2021-11-23 00:41:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2021-11-23 00:41:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 00:41:52,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:52,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2021-11-23 00:41:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2021-11-23 00:41:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:41:52,216 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:52,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 57 states and 105 transitions. [2021-11-23 00:41:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 105 transitions. [2021-11-23 00:41:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:41:54,300 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:54,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 58 states and 106 transitions. [2021-11-23 00:41:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 106 transitions. [2021-11-23 00:41:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 00:41:54,488 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:54,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 61 states and 112 transitions. [2021-11-23 00:41:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2021-11-23 00:41:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 00:41:54,870 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:54,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:41:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 77 states and 145 transitions. [2021-11-23 00:41:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 145 transitions. [2021-11-23 00:41:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 00:41:59,339 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:59,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 91 states and 166 transitions. [2021-11-23 00:42:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 166 transitions. [2021-11-23 00:42:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:42:02,585 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:02,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 109 states and 201 transitions. [2021-11-23 00:42:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 201 transitions. [2021-11-23 00:42:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:42:07,527 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:07,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 110 states and 204 transitions. [2021-11-23 00:42:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 204 transitions. [2021-11-23 00:42:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:42:08,130 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:08,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 111 states and 205 transitions. [2021-11-23 00:42:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 205 transitions. [2021-11-23 00:42:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:42:08,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:08,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 130 states and 240 transitions. [2021-11-23 00:42:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 240 transitions. [2021-11-23 00:42:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:42:15,596 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:15,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 138 states and 255 transitions. [2021-11-23 00:42:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 255 transitions. [2021-11-23 00:42:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:42:21,294 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:21,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 148 states and 271 transitions. [2021-11-23 00:42:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 271 transitions. [2021-11-23 00:42:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:42:26,429 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:26,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 176 states and 335 transitions. [2021-11-23 00:42:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 335 transitions. [2021-11-23 00:42:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:42:35,744 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:35,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 188 states and 359 transitions. [2021-11-23 00:42:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 359 transitions. [2021-11-23 00:42:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:42:42,272 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:42,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 189 states and 360 transitions. [2021-11-23 00:42:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 360 transitions. [2021-11-23 00:42:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:42:43,059 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:43,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:42:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 204 states and 399 transitions. [2021-11-23 00:42:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 399 transitions. [2021-11-23 00:42:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:42:50,914 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:50,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 226 states and 439 transitions. [2021-11-23 00:43:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 439 transitions. [2021-11-23 00:43:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:43:00,635 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:00,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 229 states and 451 transitions. [2021-11-23 00:43:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 451 transitions. [2021-11-23 00:43:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:43:02,897 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:02,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 238 states and 475 transitions. [2021-11-23 00:43:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 475 transitions. [2021-11-23 00:43:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:43:10,830 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:10,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 241 states and 488 transitions. [2021-11-23 00:43:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 488 transitions. [2021-11-23 00:43:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:43:13,292 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:13,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 242 states and 489 transitions. [2021-11-23 00:43:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 489 transitions. [2021-11-23 00:43:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:43:14,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:14,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 246 states and 501 transitions. [2021-11-23 00:43:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 501 transitions. [2021-11-23 00:43:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:43:17,350 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:17,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 251 states and 513 transitions. [2021-11-23 00:43:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 513 transitions. [2021-11-23 00:43:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:43:20,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:20,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 254 states and 524 transitions. [2021-11-23 00:43:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 524 transitions. [2021-11-23 00:43:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:43:23,250 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:23,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 255 states and 525 transitions. [2021-11-23 00:43:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 525 transitions. [2021-11-23 00:43:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:43:24,408 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:24,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 257 states and 531 transitions. [2021-11-23 00:43:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 531 transitions. [2021-11-23 00:43:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:43:28,943 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:28,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 00:43:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 258 states and 532 transitions. [2021-11-23 00:43:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 532 transitions. [2021-11-23 00:43:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:43:29,465 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:29,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 262 states and 547 transitions. [2021-11-23 00:43:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 547 transitions. [2021-11-23 00:43:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:43:33,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:33,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 264 states and 549 transitions. [2021-11-23 00:43:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 549 transitions. [2021-11-23 00:43:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:43:35,465 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:35,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 265 states and 551 transitions. [2021-11-23 00:43:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 551 transitions. [2021-11-23 00:43:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:43:36,861 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:36,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 268 states and 561 transitions. [2021-11-23 00:43:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 561 transitions. [2021-11-23 00:43:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 00:43:38,748 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:38,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 00:43:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 268 states and 560 transitions. [2021-11-23 00:43:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 560 transitions. [2021-11-23 00:43:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 00:43:38,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:38,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:43:39,601 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:43:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:43:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:43:41,240 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:43:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:43:41,624 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2021-11-23 00:43:41,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:43:41 ImpRootNode [2021-11-23 00:43:41,884 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 00:43:41,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 00:43:41,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 00:43:41,885 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 00:43:41,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:46" (3/4) ... [2021-11-23 00:43:41,887 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 00:43:42,125 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 00:43:42,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 00:43:42,126 INFO L158 Benchmark]: Toolchain (without parser) took 118000.50ms. Allocated memory was 90.2MB in the beginning and 906.0MB in the end (delta: 815.8MB). Free memory was 49.4MB in the beginning and 322.8MB in the end (delta: -273.4MB). Peak memory consumption was 542.1MB. Max. memory is 16.1GB. [2021-11-23 00:43:42,127 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:43:42,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.68ms. Allocated memory is still 90.2MB. Free memory was 49.2MB in the beginning and 60.2MB in the end (delta: -11.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:43:42,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.68ms. Allocated memory is still 90.2MB. Free memory was 60.0MB in the beginning and 57.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:43:42,128 INFO L158 Benchmark]: Boogie Preprocessor took 43.24ms. Allocated memory is still 90.2MB. Free memory was 57.1MB in the beginning and 55.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 00:43:42,129 INFO L158 Benchmark]: RCFGBuilder took 1434.58ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.0MB in the beginning and 50.6MB in the end (delta: 4.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2021-11-23 00:43:42,129 INFO L158 Benchmark]: CodeCheck took 115810.31ms. Allocated memory was 109.1MB in the beginning and 906.0MB in the end (delta: 796.9MB). Free memory was 50.6MB in the beginning and 342.7MB in the end (delta: -292.1MB). Peak memory consumption was 507.3MB. Max. memory is 16.1GB. [2021-11-23 00:43:42,130 INFO L158 Benchmark]: Witness Printer took 240.81ms. Allocated memory is still 906.0MB. Free memory was 342.7MB in the beginning and 322.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-23 00:43:42,132 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: 115.5s, OverallIterations: 39, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13179 SdHoareTripleChecker+Valid, 81.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11911 mSDsluCounter, 4869 SdHoareTripleChecker+Invalid, 71.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4168 mSDsCounter, 3888 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34243 IncrementalHoareTripleChecker+Invalid, 38131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3888 mSolverCounterUnsat, 701 mSDtfsCounter, 34243 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11286 GetRequests, 10029 SyntacticMatches, 457 SemanticMatches, 800 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372247 ImplicationChecksByTransitivity, 96.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 11254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 183/699 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND TRUE \read(r131) [L232] COND TRUE \read(ep32) [L233] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND TRUE \read(ep31) [L259] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [c1=0, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, i2=0, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, i2=1, id1=125, id2=126, id3=124, m1=126, m2=127, m3=0, max1=125, max2=126, max3=124, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=124, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND TRUE (int )m3 > (int )max3 [L167] max3 = m3 [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND TRUE (int )m3 > (int )max3 [L174] max3 = m3 [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, i2=2, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [c1=1, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, i2=3, id1=125, id2=126, id3=124, m1=124, m2=124, m3=126, max1=125, max2=126, max3=126, 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=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=126, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] st1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND FALSE !((int )max3 == (int )id3) [L181] nl3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=0] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=0, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=0] [L555] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=255, ep21=0, ep23=1, ep31=255, ep32=255, id1=125, id2=126, id3=124, m1=126, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.68ms. Allocated memory is still 90.2MB. Free memory was 49.2MB in the beginning and 60.2MB in the end (delta: -11.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.68ms. Allocated memory is still 90.2MB. Free memory was 60.0MB in the beginning and 57.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.24ms. Allocated memory is still 90.2MB. Free memory was 57.1MB in the beginning and 55.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1434.58ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.0MB in the beginning and 50.6MB in the end (delta: 4.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * CodeCheck took 115810.31ms. Allocated memory was 109.1MB in the beginning and 906.0MB in the end (delta: 796.9MB). Free memory was 50.6MB in the beginning and 342.7MB in the end (delta: -292.1MB). Peak memory consumption was 507.3MB. Max. memory is 16.1GB. * Witness Printer took 240.81ms. Allocated memory is still 906.0MB. Free memory was 342.7MB in the beginning and 322.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 00:43:42,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0762b9c3-ca36-4b54-aedc-d2dc60c79374/bin/ukojak-LBtLqBUTdQ/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