./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/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_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/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_a1f7cbfe-423e-4512-b451-19a587d25898/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 c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:26:58,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:26:58,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:26:58,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:26:58,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:26:58,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:26:58,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:26:58,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:26:58,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:26:58,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:26:58,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:26:58,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:26:58,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:26:58,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:26:58,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:26:58,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:26:58,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:26:58,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:26:58,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:26:58,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:26:58,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:26:58,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:26:58,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:26:58,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:26:58,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:26:58,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:26:58,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:26:58,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:26:58,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:26:58,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:26:58,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:26:58,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:26:58,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:26:58,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:26:58,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:26:58,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:26:58,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:26:58,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:26:58,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:26:58,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:26:58,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:26:58,529 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:26:58,553 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:26:58,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:26:58,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:26:58,555 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:26:58,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:26:58,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:26:58,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:26:58,556 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:26:58,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:26:58,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:26:58,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:26:58,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:26:58,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:26:58,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:26:58,558 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:26:58,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:26:58,558 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:26:58,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:26:58,559 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:26:58,559 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:26:58,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:26:58,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:26:58,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:26:58,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:26:58,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:26:58,561 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:26:58,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:26:58,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:26:58,562 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_a1f7cbfe-423e-4512-b451-19a587d25898/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_a1f7cbfe-423e-4512-b451-19a587d25898/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 -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2021-11-23 00:26:58,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:26:58,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:26:58,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:26:58,821 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:26:58,822 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:26:58,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-11-23 00:26:58,887 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/data/ade83a5c7/c2ae6ee1ffb743949e28335f312ed956/FLAG5ce2726ac [2021-11-23 00:26:59,358 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:26:59,359 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2021-11-23 00:26:59,370 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/data/ade83a5c7/c2ae6ee1ffb743949e28335f312ed956/FLAG5ce2726ac [2021-11-23 00:26:59,695 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/data/ade83a5c7/c2ae6ee1ffb743949e28335f312ed956 [2021-11-23 00:26:59,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:26:59,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:26:59,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:26:59,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:26:59,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:26:59,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:59" (1/1) ... [2021-11-23 00:26:59,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330dc0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:59, skipping insertion in model container [2021-11-23 00:26:59,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:59" (1/1) ... [2021-11-23 00:26:59,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:26:59,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:27:00,026 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_a1f7cbfe-423e-4512-b451-19a587d25898/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2021-11-23 00:27:00,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:27:00,038 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:27:00,096 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_a1f7cbfe-423e-4512-b451-19a587d25898/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2021-11-23 00:27:00,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:27:00,112 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:27:00,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00 WrapperNode [2021-11-23 00:27:00,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:27:00,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:27:00,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:27:00,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:27:00,132 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:27:00" (1/1) ... [2021-11-23 00:27:00,143 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:27:00" (1/1) ... [2021-11-23 00:27:00,182 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2021-11-23 00:27:00,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:27:00,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:27:00,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:27:00,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:27:00,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:27:00,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:27:00,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:27:00,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:27:00,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:00" (1/1) ... [2021-11-23 00:27:00,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:27:00,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:27:00,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:27:00,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:27:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:27:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:27:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:27:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:27:00,521 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:27:00,522 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:27:01,118 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:27:01,674 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:27:01,674 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 00:27:01,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:01 BoogieIcfgContainer [2021-11-23 00:27:01,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:27:01,677 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:27:01,678 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:27:01,687 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:27:01,687 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:01" (1/1) ... [2021-11-23 00:27:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:27:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 00:27:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 00:27:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 00:27:01,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:01,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:02,448 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:27:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2021-11-23 00:27:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2021-11-23 00:27:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 00:27:02,579 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:02,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:02,890 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:27:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2021-11-23 00:27:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2021-11-23 00:27:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 00:27:03,184 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:03,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:03,462 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:27:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2021-11-23 00:27:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2021-11-23 00:27:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 00:27:03,931 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:03,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:04,167 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:27:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2021-11-23 00:27:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2021-11-23 00:27:04,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 00:27:04,895 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:04,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:05,182 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:27:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2021-11-23 00:27:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2021-11-23 00:27:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 00:27:06,088 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:06,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:06,287 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:27:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 46 states and 87 transitions. [2021-11-23 00:27:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 87 transitions. [2021-11-23 00:27:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 00:27:07,251 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:07,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:07,334 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:27:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 47 states and 87 transitions. [2021-11-23 00:27:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2021-11-23 00:27:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:27:07,525 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:07,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:07,571 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:27:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 48 states and 88 transitions. [2021-11-23 00:27:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 88 transitions. [2021-11-23 00:27:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:27:07,584 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:07,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:07,870 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:27:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 58 states and 107 transitions. [2021-11-23 00:27:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 107 transitions. [2021-11-23 00:27:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 00:27:09,539 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:09,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:09,735 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:27:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 61 states and 113 transitions. [2021-11-23 00:27:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 113 transitions. [2021-11-23 00:27:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 00:27:09,929 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:09,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:10,603 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:27:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 77 states and 150 transitions. [2021-11-23 00:27:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 150 transitions. [2021-11-23 00:27:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 00:27:14,377 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:14,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:14,839 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:27:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 93 states and 182 transitions. [2021-11-23 00:27:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 182 transitions. [2021-11-23 00:27:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 00:27:18,568 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:18,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:18,797 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:27:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 94 states and 185 transitions. [2021-11-23 00:27:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 185 transitions. [2021-11-23 00:27:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:27:19,181 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:19,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:20,112 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:27:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 108 states and 208 transitions. [2021-11-23 00:27:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 208 transitions. [2021-11-23 00:27:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 00:27:23,680 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:23,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:23,983 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:27:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 110 states and 214 transitions. [2021-11-23 00:27:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 214 transitions. [2021-11-23 00:27:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:27:24,629 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:24,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:25,246 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:27:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 119 states and 233 transitions. [2021-11-23 00:27:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 233 transitions. [2021-11-23 00:27:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 00:27:29,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:29,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:29,837 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:27:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 122 states and 241 transitions. [2021-11-23 00:27:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 241 transitions. [2021-11-23 00:27:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:27:31,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:31,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:31,986 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:27:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 132 states and 266 transitions. [2021-11-23 00:27:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 266 transitions. [2021-11-23 00:27:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:27:36,406 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:36,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:36,669 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:27:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 134 states and 269 transitions. [2021-11-23 00:27:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 269 transitions. [2021-11-23 00:27:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:27:37,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:37,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:37,909 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:27:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 135 states and 270 transitions. [2021-11-23 00:27:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 270 transitions. [2021-11-23 00:27:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 00:27:38,367 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:38,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:38,615 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:27:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 137 states and 275 transitions. [2021-11-23 00:27:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 275 transitions. [2021-11-23 00:27:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:27:39,797 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:39,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:27:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 142 states and 285 transitions. [2021-11-23 00:27:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 285 transitions. [2021-11-23 00:27:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:27:42,352 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:42,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:27:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 145 states and 293 transitions. [2021-11-23 00:27:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 293 transitions. [2021-11-23 00:27:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:27:43,890 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:43,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:27:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 147 states and 295 transitions. [2021-11-23 00:27:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 295 transitions. [2021-11-23 00:27:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 00:27:44,800 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:44,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:27:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 149 states and 299 transitions. [2021-11-23 00:27:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 299 transitions. [2021-11-23 00:27:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:27:45,468 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:45,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:46,442 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:27:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 159 states and 318 transitions. [2021-11-23 00:27:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 318 transitions. [2021-11-23 00:27:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:27:51,822 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:51,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:52,100 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:27:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 163 states and 327 transitions. [2021-11-23 00:27:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 327 transitions. [2021-11-23 00:27:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:27:53,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:53,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:54,082 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:27:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 164 states and 328 transitions. [2021-11-23 00:27:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 328 transitions. [2021-11-23 00:27:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:27:54,718 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:54,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:54,994 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:27:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 168 states and 336 transitions. [2021-11-23 00:27:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 336 transitions. [2021-11-23 00:27:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:27:56,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:56,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:56,770 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:27:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 170 states and 342 transitions. [2021-11-23 00:27:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 342 transitions. [2021-11-23 00:27:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 00:27:57,648 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:57,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:57,920 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:27:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 171 states and 343 transitions. [2021-11-23 00:27:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 343 transitions. [2021-11-23 00:27:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 00:27:58,617 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:58,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:27:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:27:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 171 states and 342 transitions. [2021-11-23 00:27:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 342 transitions. [2021-11-23 00:27:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:27:58,945 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:27:58,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:27:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:27:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 199 states and 414 transitions. [2021-11-23 00:28:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 414 transitions. [2021-11-23 00:28:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:28:10,654 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:10,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 201 states and 423 transitions. [2021-11-23 00:28:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 423 transitions. [2021-11-23 00:28:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:28:11,914 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:11,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 210 states and 438 transitions. [2021-11-23 00:28:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 438 transitions. [2021-11-23 00:28:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:28:15,725 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:15,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 211 states and 439 transitions. [2021-11-23 00:28:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 439 transitions. [2021-11-23 00:28:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:28:16,597 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:16,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 215 states and 445 transitions. [2021-11-23 00:28:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 445 transitions. [2021-11-23 00:28:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:28:18,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:18,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 216 states and 447 transitions. [2021-11-23 00:28:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 447 transitions. [2021-11-23 00:28:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 00:28:19,509 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:19,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 218 states and 448 transitions. [2021-11-23 00:28:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 448 transitions. [2021-11-23 00:28:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:28:21,067 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:21,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:21,972 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:28:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 229 states and 467 transitions. [2021-11-23 00:28:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 467 transitions. [2021-11-23 00:28:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:28:27,937 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:27,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:28,075 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:28:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 236 states and 484 transitions. [2021-11-23 00:28:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 484 transitions. [2021-11-23 00:28:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:28:31,642 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:31,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:31,775 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:28:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 238 states and 486 transitions. [2021-11-23 00:28:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 486 transitions. [2021-11-23 00:28:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:28:33,554 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:33,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:33,691 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:28:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 239 states and 487 transitions. [2021-11-23 00:28:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 487 transitions. [2021-11-23 00:28:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 00:28:34,739 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:34,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:34,875 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:28:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 223 states and 464 transitions. [2021-11-23 00:28:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 464 transitions. [2021-11-23 00:28:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:28:35,715 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:35,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 233 states and 483 transitions. [2021-11-23 00:28:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 483 transitions. [2021-11-23 00:28:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:28:42,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:42,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 235 states and 491 transitions. [2021-11-23 00:28:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 491 transitions. [2021-11-23 00:28:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:28:45,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:45,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 240 states and 498 transitions. [2021-11-23 00:28:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 498 transitions. [2021-11-23 00:28:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:28:47,318 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:47,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 241 states and 499 transitions. [2021-11-23 00:28:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 499 transitions. [2021-11-23 00:28:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 00:28:48,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:48,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 229 states and 483 transitions. [2021-11-23 00:28:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 483 transitions. [2021-11-23 00:28:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:28:49,764 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:49,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 238 states and 504 transitions. [2021-11-23 00:28:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 504 transitions. [2021-11-23 00:28:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:28:56,534 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:56,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:28:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:28:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 241 states and 515 transitions. [2021-11-23 00:28:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 515 transitions. [2021-11-23 00:28:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:28:58,722 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:28:58,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:28:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:28:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 241 states and 514 transitions. [2021-11-23 00:29:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 514 transitions. [2021-11-23 00:29:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:29:01,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:01,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 242 states and 520 transitions. [2021-11-23 00:29:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 520 transitions. [2021-11-23 00:29:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:29:02,116 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:02,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 243 states and 521 transitions. [2021-11-23 00:29:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 521 transitions. [2021-11-23 00:29:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 00:29:03,203 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:03,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 238 states and 515 transitions. [2021-11-23 00:29:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 515 transitions. [2021-11-23 00:29:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:29:04,078 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:04,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:05,413 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:29:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 244 states and 532 transitions. [2021-11-23 00:29:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 532 transitions. [2021-11-23 00:29:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:29:10,875 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:10,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:11,169 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:29:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 244 states and 535 transitions. [2021-11-23 00:29:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 535 transitions. [2021-11-23 00:29:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:29:12,900 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:12,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:13,187 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:29:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 245 states and 539 transitions. [2021-11-23 00:29:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 539 transitions. [2021-11-23 00:29:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:29:14,044 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:14,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:14,321 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:29:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 246 states and 541 transitions. [2021-11-23 00:29:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 541 transitions. [2021-11-23 00:29:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:29:15,102 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:15,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:15,330 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:29:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 248 states and 550 transitions. [2021-11-23 00:29:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 550 transitions. [2021-11-23 00:29:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 00:29:17,065 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:17,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:17,312 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:29:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 249 states and 553 transitions. [2021-11-23 00:29:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 553 transitions. [2021-11-23 00:29:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:29:18,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:18,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:18,646 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:29:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 253 states and 564 transitions. [2021-11-23 00:29:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 564 transitions. [2021-11-23 00:29:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:29:21,397 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:21,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:21,521 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:29:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 254 states and 571 transitions. [2021-11-23 00:29:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 571 transitions. [2021-11-23 00:29:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:29:22,321 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:22,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:22,567 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:29:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 255 states and 574 transitions. [2021-11-23 00:29:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 574 transitions. [2021-11-23 00:29:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:29:23,306 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:23,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:23,418 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:29:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 258 states and 582 transitions. [2021-11-23 00:29:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 582 transitions. [2021-11-23 00:29:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 00:29:25,472 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:25,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:25,571 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:29:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 259 states and 583 transitions. [2021-11-23 00:29:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 583 transitions. [2021-11-23 00:29:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:29:26,513 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:26,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 262 states and 595 transitions. [2021-11-23 00:29:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 595 transitions. [2021-11-23 00:29:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:29:30,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:30,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 263 states and 596 transitions. [2021-11-23 00:29:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 596 transitions. [2021-11-23 00:29:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:29:31,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:31,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 264 states and 597 transitions. [2021-11-23 00:29:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 597 transitions. [2021-11-23 00:29:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:29:32,796 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:32,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 267 states and 607 transitions. [2021-11-23 00:29:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 607 transitions. [2021-11-23 00:29:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 00:29:34,749 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:34,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:29:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:29:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:29:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 268 states and 608 transitions. [2021-11-23 00:29:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 608 transitions. [2021-11-23 00:29:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 00:29:35,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:29:35,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:29:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:29:36,575 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:29:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:29:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:29:37,479 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:29:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:29:37,838 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 72 iterations. [2021-11-23 00:29:38,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:29:38 ImpRootNode [2021-11-23 00:29:38,084 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 00:29:38,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 00:29:38,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 00:29:38,085 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 00:29:38,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:01" (3/4) ... [2021-11-23 00:29:38,087 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 00:29:38,320 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 00:29:38,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 00:29:38,321 INFO L158 Benchmark]: Toolchain (without parser) took 158622.36ms. Allocated memory was 98.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 60.4MB in the beginning and 506.9MB in the end (delta: -446.5MB). Peak memory consumption was 797.1MB. Max. memory is 16.1GB. [2021-11-23 00:29:38,321 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:29:38,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.99ms. Allocated memory is still 98.6MB. Free memory was 60.2MB in the beginning and 68.4MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 00:29:38,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.70ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 65.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:29:38,323 INFO L158 Benchmark]: Boogie Preprocessor took 43.11ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:29:38,323 INFO L158 Benchmark]: RCFGBuilder took 1449.81ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 62.9MB in the beginning and 78.2MB in the end (delta: -15.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2021-11-23 00:29:38,323 INFO L158 Benchmark]: CodeCheck took 156406.53ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 78.2MB in the beginning and 527.9MB in the end (delta: -449.7MB). Peak memory consumption was 766.6MB. Max. memory is 16.1GB. [2021-11-23 00:29:38,324 INFO L158 Benchmark]: Witness Printer took 236.04ms. Allocated memory is still 1.3GB. Free memory was 527.9MB in the beginning and 506.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 00:29:38,326 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: 156.1s, OverallIterations: 72, 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, 34443 SdHoareTripleChecker+Valid, 204.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32076 mSDsluCounter, 7862 SdHoareTripleChecker+Invalid, 177.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6693 mSDsCounter, 10304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89701 IncrementalHoareTripleChecker+Invalid, 100005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10304 mSolverCounterUnsat, 1169 mSDtfsCounter, 89701 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22315 GetRequests, 20217 SyntacticMatches, 1050 SemanticMatches, 1048 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626672 ImplicationChecksByTransitivity, 131.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 9.8s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 2169 NumberOfCodeBlocks, 2169 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 2050 ConstructedInterpolants, 0 QuantifiedInterpolants, 21132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 11 PerfectInterpolantSequences, 264/1311 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 573]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] _Bool newmax1 ; [L57] char id2 ; [L58] char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] _Bool newmax2 ; [L65] char id3 ; [L66] char r3 ; [L67] char st3 ; [L68] char nl3 ; [L69] char m3 ; [L70] char max3 ; [L71] _Bool mode3 ; [L72] _Bool newmax3 ; [L491] int c1 ; [L492] int i2 ; [L495] c1 = 0 [L496] ep12 = __VERIFIER_nondet_bool() [L497] ep13 = __VERIFIER_nondet_bool() [L498] ep21 = __VERIFIER_nondet_bool() [L499] ep23 = __VERIFIER_nondet_bool() [L500] ep31 = __VERIFIER_nondet_bool() [L501] ep32 = __VERIFIER_nondet_bool() [L502] id1 = __VERIFIER_nondet_char() [L503] r1 = __VERIFIER_nondet_char() [L504] st1 = __VERIFIER_nondet_char() [L505] nl1 = __VERIFIER_nondet_char() [L506] m1 = __VERIFIER_nondet_char() [L507] max1 = __VERIFIER_nondet_char() [L508] mode1 = __VERIFIER_nondet_bool() [L509] newmax1 = __VERIFIER_nondet_bool() [L510] id2 = __VERIFIER_nondet_char() [L511] r2 = __VERIFIER_nondet_char() [L512] st2 = __VERIFIER_nondet_char() [L513] nl2 = __VERIFIER_nondet_char() [L514] m2 = __VERIFIER_nondet_char() [L515] max2 = __VERIFIER_nondet_char() [L516] mode2 = __VERIFIER_nondet_bool() [L517] newmax2 = __VERIFIER_nondet_bool() [L518] id3 = __VERIFIER_nondet_char() [L519] r3 = __VERIFIER_nondet_char() [L520] st3 = __VERIFIER_nondet_char() [L521] nl3 = __VERIFIER_nondet_char() [L522] m3 = __VERIFIER_nondet_char() [L523] max3 = __VERIFIER_nondet_char() [L524] mode3 = __VERIFIER_nondet_bool() [L525] newmax3 = __VERIFIER_nondet_bool() [L526] CALL, EXPR init() [L228] _Bool r121 ; [L229] _Bool r131 ; [L230] _Bool r211 ; [L231] _Bool r231 ; [L232] _Bool r311 ; [L233] _Bool r321 ; [L234] _Bool r122 ; [L235] int tmp ; [L236] _Bool r132 ; [L237] int tmp___0 ; [L238] _Bool r212 ; [L239] int tmp___1 ; [L240] _Bool r232 ; [L241] int tmp___2 ; [L242] _Bool r312 ; [L243] int tmp___3 ; [L244] _Bool r322 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L249] r121 = ep12 [L250] r131 = ep13 [L251] r211 = ep21 [L252] r231 = ep23 [L253] r311 = ep31 [L254] r321 = ep32 [L255] COND FALSE !(\read(r121)) [L258] COND FALSE !(\read(r131)) [L265] tmp = 0 [L267] r122 = (_Bool )tmp [L268] COND FALSE !(\read(r131)) [L271] COND FALSE !(\read(r121)) [L278] tmp___0 = 0 [L280] r132 = (_Bool )tmp___0 [L281] COND FALSE !(\read(r211)) [L284] COND TRUE \read(r231) [L285] COND FALSE !(\read(ep31)) [L288] tmp___1 = 0 [L293] r212 = (_Bool )tmp___1 [L294] COND TRUE \read(r231) [L295] tmp___2 = 1 [L306] r232 = (_Bool )tmp___2 [L307] COND FALSE !(\read(r311)) [L310] COND FALSE !(\read(r321)) [L317] tmp___3 = 0 [L319] r312 = (_Bool )tmp___3 [L320] COND FALSE !(\read(r321)) [L323] COND FALSE !(\read(r311)) [L330] tmp___4 = 0 [L332] r322 = (_Bool )tmp___4 [L333] COND TRUE (int )id1 != (int )id2 [L334] COND TRUE (int )id1 != (int )id3 [L335] COND TRUE (int )id2 != (int )id3 [L336] COND TRUE (int )id1 >= 0 [L337] COND TRUE (int )id2 >= 0 [L338] COND TRUE (int )id3 >= 0 [L339] COND TRUE (int )r1 == 0 [L340] COND TRUE (int )r2 == 0 [L341] COND TRUE (int )r3 == 0 [L342] COND TRUE (int )max1 == (int )id1 [L343] COND TRUE (int )max2 == (int )id2 [L344] COND TRUE (int )max3 == (int )id3 [L345] COND TRUE (int )st1 == 0 [L346] COND TRUE (int )st2 == 0 [L347] COND TRUE (int )st3 == 0 [L348] COND TRUE (int )nl1 == 0 [L349] COND TRUE (int )nl2 == 0 [L350] COND TRUE (int )nl3 == 0 [L351] COND TRUE (int )mode1 == 0 [L352] COND TRUE (int )mode2 == 0 [L353] COND TRUE (int )mode3 == 0 [L354] COND TRUE \read(newmax1) [L355] COND TRUE \read(newmax2) [L356] COND TRUE \read(newmax3) [L357] tmp___5 = 1 [L430] return (tmp___5); [L526] RET, EXPR init() [L526] i2 = init() [L527] COND FALSE !(!(i2)) [L528] p12_old = nomsg [L529] p12_new = nomsg [L530] p13_old = nomsg [L531] p13_new = nomsg [L532] p21_old = nomsg [L533] p21_new = nomsg [L534] p23_old = nomsg [L535] p23_new = nomsg [L536] p31_old = nomsg [L537] p31_new = nomsg [L538] p32_old = nomsg [L539] p32_new = nomsg [L540] i2 = 0 VAL [c1=0, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND TRUE \read(newmax2) [L166] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L166] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=1, id1=2, id2=0, id3=1, m1=1, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND FALSE !((int )r2 == 2) [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND FALSE !((int )m3 > (int )max3) [L199] newmax3 = newmax [L200] COND FALSE !((int )r3 == 2) [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=2, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND FALSE !(\read(newmax2)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=3, id1=2, id2=0, id3=1, m1=1, m2=1, m3=0, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND TRUE (int )r2 == 2 [L150] COND TRUE (int )max2 == (int )id2 [L151] st2 = (char)1 [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND FALSE !((int )m3 > (int )max3) [L199] newmax3 = newmax [L200] COND TRUE (int )r3 == 2 [L201] COND TRUE (int )max3 == (int )id3 [L202] st3 = (char)1 [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=-1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L438] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L484] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=-1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=-1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L573] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=1, m2=1, m3=-1, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.99ms. Allocated memory is still 98.6MB. Free memory was 60.2MB in the beginning and 68.4MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.70ms. Allocated memory is still 98.6MB. Free memory was 68.4MB in the beginning and 65.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.11ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1449.81ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 62.9MB in the beginning and 78.2MB in the end (delta: -15.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * CodeCheck took 156406.53ms. Allocated memory was 125.8MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 78.2MB in the beginning and 527.9MB in the end (delta: -449.7MB). Peak memory consumption was 766.6MB. Max. memory is 16.1GB. * Witness Printer took 236.04ms. Allocated memory is still 1.3GB. Free memory was 527.9MB in the beginning and 506.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 00:29:38,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1f7cbfe-423e-4512-b451-19a587d25898/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