./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.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_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/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_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/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_654a33b4-8759-4e9e-adba-008f7e5e0d46/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 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:55:56,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:55:56,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:55:56,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:55:56,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:55:56,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:55:56,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:55:56,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:55:56,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:55:56,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:55:56,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:55:56,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:55:56,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:55:56,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:55:56,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:55:56,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:55:56,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:55:56,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:55:56,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:55:56,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:55:56,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:55:56,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:55:56,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:55:56,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:55:56,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:55:56,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:55:56,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:55:56,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:55:56,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:55:56,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:55:56,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:55:56,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:55:56,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:55:56,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:55:56,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:55:56,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:55:56,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:55:56,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:55:56,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:55:56,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:55:56,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:55:56,476 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:55:56,521 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:55:56,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:55:56,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:55:56,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:55:56,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:55:56,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:55:56,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:55:56,524 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:55:56,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:55:56,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:55:56,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:55:56,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:55:56,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:55:56,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:55:56,527 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:55:56,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:55:56,527 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:55:56,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:55:56,528 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:55:56,528 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:55:56,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:55:56,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:55:56,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:55:56,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:55:56,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:55:56,529 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:55:56,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:55:56,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:55:56,530 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_654a33b4-8759-4e9e-adba-008f7e5e0d46/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_654a33b4-8759-4e9e-adba-008f7e5e0d46/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 -> 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 [2021-11-23 00:55:56,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:55:56,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:55:56,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:55:56,873 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:55:56,875 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:55:56,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2021-11-23 00:55:56,949 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/data/a77f59367/f7536356dffe49f1b32e231ed85097ca/FLAGc3a7ef6b6 [2021-11-23 00:55:57,564 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:55:57,564 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2021-11-23 00:55:57,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/data/a77f59367/f7536356dffe49f1b32e231ed85097ca/FLAGc3a7ef6b6 [2021-11-23 00:55:57,801 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/data/a77f59367/f7536356dffe49f1b32e231ed85097ca [2021-11-23 00:55:57,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:55:57,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:55:57,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:55:57,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:55:57,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:55:57,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:57" (1/1) ... [2021-11-23 00:55:57,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e14aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:57, skipping insertion in model container [2021-11-23 00:55:57,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:57" (1/1) ... [2021-11-23 00:55:57,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:55:57,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:55:58,226 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_654a33b4-8759-4e9e-adba-008f7e5e0d46/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2021-11-23 00:55:58,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:55:58,298 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:55:58,460 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_654a33b4-8759-4e9e-adba-008f7e5e0d46/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2021-11-23 00:55:58,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:55:58,511 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:55:58,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58 WrapperNode [2021-11-23 00:55:58,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:55:58,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:55:58,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:55:58,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:55:58,522 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:55:58" (1/1) ... [2021-11-23 00:55:58,551 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:55:58" (1/1) ... [2021-11-23 00:55:58,624 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2021-11-23 00:55:58,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:55:58,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:55:58,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:55:58,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:55:58,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:55:58,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:55:58,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:55:58,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:55:58,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:58" (1/1) ... [2021-11-23 00:55:58,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:55:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:55:58,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:55:58,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:55:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:55:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:55:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:55:58,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:55:58,955 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:55:58,957 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:56:00,075 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:56:00,293 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:56:00,293 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 00:56:00,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:00 BoogieIcfgContainer [2021-11-23 00:56:00,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:56:00,299 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:56:00,299 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:56:00,310 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:56:00,310 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:00" (1/1) ... [2021-11-23 00:56:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:56:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-11-23 00:56:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-11-23 00:56:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 00:56:00,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:00,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:00,767 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:56:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2021-11-23 00:56:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2021-11-23 00:56:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-23 00:56:01,277 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:01,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2021-11-23 00:56:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2021-11-23 00:56:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-23 00:56:01,607 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:01,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2021-11-23 00:56:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2021-11-23 00:56:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-23 00:56:01,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:01,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2021-11-23 00:56:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2021-11-23 00:56:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-23 00:56:01,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:01,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2021-11-23 00:56:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2021-11-23 00:56:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 00:56:02,224 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:02,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2021-11-23 00:56:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2021-11-23 00:56:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 00:56:02,402 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:02,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2021-11-23 00:56:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2021-11-23 00:56:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-23 00:56:02,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:02,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2021-11-23 00:56:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2021-11-23 00:56:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 00:56:02,928 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:02,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2021-11-23 00:56:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2021-11-23 00:56:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-23 00:56:03,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:03,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2021-11-23 00:56:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2021-11-23 00:56:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-23 00:56:04,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:04,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2021-11-23 00:56:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2021-11-23 00:56:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 00:56:04,761 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:04,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 232 states and 369 transitions. [2021-11-23 00:56:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2021-11-23 00:56:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 00:56:05,127 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:05,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 246 states and 387 transitions. [2021-11-23 00:56:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2021-11-23 00:56:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-23 00:56:05,659 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:05,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 251 states and 393 transitions. [2021-11-23 00:56:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 393 transitions. [2021-11-23 00:56:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-23 00:56:05,797 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:05,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 252 states and 394 transitions. [2021-11-23 00:56:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2021-11-23 00:56:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-23 00:56:05,978 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:05,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 271 states and 424 transitions. [2021-11-23 00:56:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2021-11-23 00:56:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-23 00:56:06,892 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:06,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 272 states and 425 transitions. [2021-11-23 00:56:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 425 transitions. [2021-11-23 00:56:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-23 00:56:07,086 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:07,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 287 states and 444 transitions. [2021-11-23 00:56:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2021-11-23 00:56:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 00:56:07,759 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:07,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 305 states and 464 transitions. [2021-11-23 00:56:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2021-11-23 00:56:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 00:56:08,445 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:08,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 309 states and 468 transitions. [2021-11-23 00:56:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2021-11-23 00:56:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 00:56:08,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:08,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 313 states and 475 transitions. [2021-11-23 00:56:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2021-11-23 00:56:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 00:56:08,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:08,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 314 states and 477 transitions. [2021-11-23 00:56:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2021-11-23 00:56:09,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 00:56:09,129 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:09,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 322 states and 492 transitions. [2021-11-23 00:56:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 492 transitions. [2021-11-23 00:56:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 00:56:09,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:09,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 328 states and 501 transitions. [2021-11-23 00:56:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2021-11-23 00:56:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 00:56:10,077 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:10,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 331 states and 506 transitions. [2021-11-23 00:56:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2021-11-23 00:56:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 00:56:10,335 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:10,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 346 states and 527 transitions. [2021-11-23 00:56:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2021-11-23 00:56:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 00:56:10,800 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:10,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 360 states and 544 transitions. [2021-11-23 00:56:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2021-11-23 00:56:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 00:56:11,117 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:11,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2021-11-23 00:56:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2021-11-23 00:56:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 00:56:11,462 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:11,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 368 states and 553 transitions. [2021-11-23 00:56:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2021-11-23 00:56:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 00:56:11,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:11,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 372 states and 556 transitions. [2021-11-23 00:56:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 556 transitions. [2021-11-23 00:56:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 00:56:11,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:11,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 374 states and 559 transitions. [2021-11-23 00:56:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 559 transitions. [2021-11-23 00:56:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 00:56:11,928 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:11,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2021-11-23 00:56:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2021-11-23 00:56:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 00:56:12,410 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:12,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 392 states and 582 transitions. [2021-11-23 00:56:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 582 transitions. [2021-11-23 00:56:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-23 00:56:12,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:12,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 394 states and 585 transitions. [2021-11-23 00:56:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 585 transitions. [2021-11-23 00:56:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 00:56:12,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:12,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 397 states and 589 transitions. [2021-11-23 00:56:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2021-11-23 00:56:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 00:56:12,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:12,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 406 states and 599 transitions. [2021-11-23 00:56:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2021-11-23 00:56:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 00:56:13,364 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:13,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 410 states and 602 transitions. [2021-11-23 00:56:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 602 transitions. [2021-11-23 00:56:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-23 00:56:13,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:13,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 413 states and 605 transitions. [2021-11-23 00:56:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2021-11-23 00:56:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-23 00:56:13,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:13,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:56:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 488 states and 682 transitions. [2021-11-23 00:56:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 682 transitions. [2021-11-23 00:56:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 00:56:14,796 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:14,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 502 states and 698 transitions. [2021-11-23 00:56:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 698 transitions. [2021-11-23 00:56:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 00:56:14,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:14,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 513 states and 711 transitions. [2021-11-23 00:56:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 711 transitions. [2021-11-23 00:56:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-23 00:56:15,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:15,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:56:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 518 states and 718 transitions. [2021-11-23 00:56:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 718 transitions. [2021-11-23 00:56:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 00:56:15,383 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:15,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 542 states and 753 transitions. [2021-11-23 00:56:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 753 transitions. [2021-11-23 00:56:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 00:56:16,166 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:16,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 546 states and 757 transitions. [2021-11-23 00:56:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 757 transitions. [2021-11-23 00:56:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 00:56:16,423 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:16,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 553 states and 765 transitions. [2021-11-23 00:56:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 765 transitions. [2021-11-23 00:56:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 00:56:16,744 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:16,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 555 states and 766 transitions. [2021-11-23 00:56:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 766 transitions. [2021-11-23 00:56:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 00:56:16,984 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:16,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 593 states and 811 transitions. [2021-11-23 00:56:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 811 transitions. [2021-11-23 00:56:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 00:56:17,791 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:17,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 596 states and 813 transitions. [2021-11-23 00:56:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 813 transitions. [2021-11-23 00:56:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 00:56:18,103 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:18,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 599 states and 815 transitions. [2021-11-23 00:56:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 815 transitions. [2021-11-23 00:56:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-23 00:56:18,412 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:18,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 608 states and 827 transitions. [2021-11-23 00:56:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 827 transitions. [2021-11-23 00:56:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-23 00:56:18,508 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:18,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:56:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 617 states and 836 transitions. [2021-11-23 00:56:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 836 transitions. [2021-11-23 00:56:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-23 00:56:18,814 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:18,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-23 00:56:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 706 states and 928 transitions. [2021-11-23 00:56:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 928 transitions. [2021-11-23 00:56:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 00:56:19,834 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:19,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 733 states and 956 transitions. [2021-11-23 00:56:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 956 transitions. [2021-11-23 00:56:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-23 00:56:20,050 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:20,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 761 states and 985 transitions. [2021-11-23 00:56:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 985 transitions. [2021-11-23 00:56:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-23 00:56:20,453 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:20,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-23 00:56:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 762 states and 985 transitions. [2021-11-23 00:56:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 985 transitions. [2021-11-23 00:56:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-23 00:56:20,567 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:20,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 790 states and 1014 transitions. [2021-11-23 00:56:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1014 transitions. [2021-11-23 00:56:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-23 00:56:21,669 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:21,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 817 states and 1046 transitions. [2021-11-23 00:56:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1046 transitions. [2021-11-23 00:56:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-23 00:56:22,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:22,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 824 states and 1053 transitions. [2021-11-23 00:56:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1053 transitions. [2021-11-23 00:56:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-23 00:56:22,573 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:22,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 887 states and 1123 transitions. [2021-11-23 00:56:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1123 transitions. [2021-11-23 00:56:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-23 00:56:24,133 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:24,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:56:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 908 states and 1143 transitions. [2021-11-23 00:56:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1143 transitions. [2021-11-23 00:56:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:56:24,868 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:24,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 00:56:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 911 states and 1146 transitions. [2021-11-23 00:56:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1146 transitions. [2021-11-23 00:56:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:56:25,075 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:25,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:56:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 947 states and 1182 transitions. [2021-11-23 00:56:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1182 transitions. [2021-11-23 00:56:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-23 00:56:25,257 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:25,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 954 states and 1188 transitions. [2021-11-23 00:56:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1188 transitions. [2021-11-23 00:56:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-23 00:56:25,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:25,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 968 states and 1202 transitions. [2021-11-23 00:56:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1202 transitions. [2021-11-23 00:56:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-23 00:56:26,234 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:26,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 972 states and 1205 transitions. [2021-11-23 00:56:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1205 transitions. [2021-11-23 00:56:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-23 00:56:26,530 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:26,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 982 states and 1216 transitions. [2021-11-23 00:56:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1216 transitions. [2021-11-23 00:56:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-23 00:56:27,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:27,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:56:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 985 states and 1218 transitions. [2021-11-23 00:56:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1218 transitions. [2021-11-23 00:56:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-23 00:56:27,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:27,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 119 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 00:56:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1033 states and 1272 transitions. [2021-11-23 00:56:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1272 transitions. [2021-11-23 00:56:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-23 00:56:28,889 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:28,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 00:56:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1039 states and 1278 transitions. [2021-11-23 00:56:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1278 transitions. [2021-11-23 00:56:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-23 00:56:29,439 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:29,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 00:56:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1048 states and 1286 transitions. [2021-11-23 00:56:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1286 transitions. [2021-11-23 00:56:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-23 00:56:29,832 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:29,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:56:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 00:56:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:56:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1052 states and 1293 transitions. [2021-11-23 00:56:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1293 transitions. [2021-11-23 00:56:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-23 00:56:30,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:56:30,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:56:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:56:30,490 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:56:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:56:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:56:30,705 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:56:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:56:30,873 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 72 iterations. [2021-11-23 00:56:31,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:56:31 ImpRootNode [2021-11-23 00:56:31,164 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 00:56:31,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 00:56:31,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 00:56:31,164 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 00:56:31,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:00" (3/4) ... [2021-11-23 00:56:31,167 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 00:56:31,318 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 00:56:31,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 00:56:31,319 INFO L158 Benchmark]: Toolchain (without parser) took 33514.71ms. Allocated memory was 104.9MB in the beginning and 337.6MB in the end (delta: 232.8MB). Free memory was 65.1MB in the beginning and 188.6MB in the end (delta: -123.5MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. [2021-11-23 00:56:31,320 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:56:31,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.42ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 62.1MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 00:56:31,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.25ms. Allocated memory is still 104.9MB. Free memory was 62.1MB in the beginning and 56.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 00:56:31,321 INFO L158 Benchmark]: Boogie Preprocessor took 119.10ms. Allocated memory is still 104.9MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:56:31,321 INFO L158 Benchmark]: RCFGBuilder took 1553.23ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 52.1MB in the beginning and 86.2MB in the end (delta: -34.1MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2021-11-23 00:56:31,322 INFO L158 Benchmark]: CodeCheck took 30864.77ms. Allocated memory was 127.9MB in the beginning and 337.6MB in the end (delta: 209.7MB). Free memory was 86.2MB in the beginning and 212.7MB in the end (delta: -126.6MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2021-11-23 00:56:31,322 INFO L158 Benchmark]: Witness Printer took 154.70ms. Allocated memory is still 337.6MB. Free memory was 212.7MB in the beginning and 188.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-23 00:56:31,324 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.5s, 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, 68916 SdHoareTripleChecker+Valid, 181.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66673 mSDsluCounter, 11786 SdHoareTripleChecker+Invalid, 150.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9799 mSDsCounter, 29258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162586 IncrementalHoareTripleChecker+Invalid, 191844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29258 mSolverCounterUnsat, 1987 mSDtfsCounter, 162586 mSolverCounterSat, 2.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59859 GetRequests, 58513 SyntacticMatches, 902 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124108 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 8343 NumberOfCodeBlocks, 8343 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 17489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 70 PerfectInterpolantSequences, 3733/3744 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: 438]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\old(input)=1, \result=24, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L276] a17 = 0 [L277] return 24; VAL [\old(input)=2, \result=24, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L323] a8 = 13 [L324] a16 = 4 [L325] return -1; VAL [\old(input)=3, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L434] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L437] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L438] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 104.9MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.42ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 62.1MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.25ms. Allocated memory is still 104.9MB. Free memory was 62.1MB in the beginning and 56.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.10ms. Allocated memory is still 104.9MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1553.23ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 52.1MB in the beginning and 86.2MB in the end (delta: -34.1MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * CodeCheck took 30864.77ms. Allocated memory was 127.9MB in the beginning and 337.6MB in the end (delta: 209.7MB). Free memory was 86.2MB in the beginning and 212.7MB in the end (delta: -126.6MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 154.70ms. Allocated memory is still 337.6MB. Free memory was 212.7MB in the beginning and 188.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 00:56:31,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654a33b4-8759-4e9e-adba-008f7e5e0d46/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