./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.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_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/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_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/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_4ba9a411-b17f-4f05-9702-a2a5d608df06/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 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:39:10,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:39:10,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:39:11,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:39:11,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:39:11,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:39:11,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:39:11,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:39:11,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:39:11,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:39:11,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:39:11,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:39:11,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:39:11,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:39:11,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:39:11,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:39:11,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:39:11,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:39:11,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:39:11,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:39:11,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:39:11,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:39:11,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:39:11,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:39:11,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:39:11,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:39:11,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:39:11,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:39:11,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:39:11,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:39:11,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:39:11,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:39:11,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:39:11,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:39:11,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:39:11,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:39:11,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:39:11,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:39:11,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:39:11,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:39:11,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:39:11,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:39:11,153 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:39:11,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:39:11,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:39:11,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:39:11,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:39:11,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:39:11,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:39:11,158 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:39:11,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:39:11,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:39:11,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:39:11,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:39:11,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:39:11,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:39:11,160 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:39:11,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:39:11,160 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:39:11,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:39:11,161 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:39:11,161 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:39:11,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:39:11,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:39:11,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:39:11,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:39:11,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:39:11,163 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:39:11,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:39:11,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:39:11,164 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_4ba9a411-b17f-4f05-9702-a2a5d608df06/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_4ba9a411-b17f-4f05-9702-a2a5d608df06/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 -> 7c8c0e9a48a9f16e1776fdefc0f855c8a0d9d5ce1c74cc0228b67d8d420034c4 [2021-11-23 00:39:11,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:39:11,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:39:11,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:39:11,549 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:39:11,551 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:39:11,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2021-11-23 00:39:11,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/data/42ba19493/eeffdd62c06b46afab75211bf13683b3/FLAG9800fe3bc [2021-11-23 00:39:12,424 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:39:12,424 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/sv-benchmarks/c/eca-rers2012/Problem01_label50.c [2021-11-23 00:39:12,447 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/data/42ba19493/eeffdd62c06b46afab75211bf13683b3/FLAG9800fe3bc [2021-11-23 00:39:12,604 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/data/42ba19493/eeffdd62c06b46afab75211bf13683b3 [2021-11-23 00:39:12,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:39:12,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:39:12,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:39:12,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:39:12,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:39:12,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:12" (1/1) ... [2021-11-23 00:39:12,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518c4db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:12, skipping insertion in model container [2021-11-23 00:39:12,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:12" (1/1) ... [2021-11-23 00:39:12,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:39:12,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:39:13,189 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_4ba9a411-b17f-4f05-9702-a2a5d608df06/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2021-11-23 00:39:13,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:39:13,266 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:39:13,369 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_4ba9a411-b17f-4f05-9702-a2a5d608df06/sv-benchmarks/c/eca-rers2012/Problem01_label50.c[15378,15391] [2021-11-23 00:39:13,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:39:13,408 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:39:13,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13 WrapperNode [2021-11-23 00:39:13,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:39:13,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:39:13,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:39:13,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:39:13,421 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:39:13" (1/1) ... [2021-11-23 00:39:13,449 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:39:13" (1/1) ... [2021-11-23 00:39:13,533 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2021-11-23 00:39:13,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:39:13,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:39:13,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:39:13,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:39:13,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:39:13,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:39:13,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:39:13,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:39:13,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:13" (1/1) ... [2021-11-23 00:39:13,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:39:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:39:13,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:39:13,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:39:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:39:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:39:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:39:13,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:39:13,895 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:39:13,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:39:15,254 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:39:15,551 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:39:15,551 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 00:39:15,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:15 BoogieIcfgContainer [2021-11-23 00:39:15,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:39:15,556 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:39:15,557 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:39:15,570 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:39:15,571 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:15" (1/1) ... [2021-11-23 00:39:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:39:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-11-23 00:39:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-11-23 00:39:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 00:39:15,711 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:15,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:16,226 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:39:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2021-11-23 00:39:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2021-11-23 00:39:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-23 00:39:16,996 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:16,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2021-11-23 00:39:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2021-11-23 00:39:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-23 00:39:17,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:17,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2021-11-23 00:39:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2021-11-23 00:39:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-23 00:39:17,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:17,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 221 states and 317 transitions. [2021-11-23 00:39:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 317 transitions. [2021-11-23 00:39:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 00:39:18,417 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:18,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:18,485 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:39:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 233 states and 332 transitions. [2021-11-23 00:39:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 332 transitions. [2021-11-23 00:39:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 00:39:18,760 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:18,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 246 states and 351 transitions. [2021-11-23 00:39:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 351 transitions. [2021-11-23 00:39:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 00:39:19,495 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:19,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 251 states and 356 transitions. [2021-11-23 00:39:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2021-11-23 00:39:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 00:39:19,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:19,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:39:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 264 states and 371 transitions. [2021-11-23 00:39:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 371 transitions. [2021-11-23 00:39:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-23 00:39:20,136 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:20,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:20,221 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:39:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 284 states and 398 transitions. [2021-11-23 00:39:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 398 transitions. [2021-11-23 00:39:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-23 00:39:20,796 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:20,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 292 states and 413 transitions. [2021-11-23 00:39:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 413 transitions. [2021-11-23 00:39:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-23 00:39:21,294 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:21,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:21,350 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:39:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 308 states and 433 transitions. [2021-11-23 00:39:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2021-11-23 00:39:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 00:39:21,790 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:21,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:21,857 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:39:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 309 states and 436 transitions. [2021-11-23 00:39:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 436 transitions. [2021-11-23 00:39:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 00:39:22,083 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:22,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:22,126 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:39:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 321 states and 449 transitions. [2021-11-23 00:39:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 449 transitions. [2021-11-23 00:39:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-23 00:39:22,526 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:22,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:22,566 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:39:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 326 states and 454 transitions. [2021-11-23 00:39:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 454 transitions. [2021-11-23 00:39:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 00:39:22,805 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:22,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:39:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 335 states and 465 transitions. [2021-11-23 00:39:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 465 transitions. [2021-11-23 00:39:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-23 00:39:23,236 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:23,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 341 states and 474 transitions. [2021-11-23 00:39:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 474 transitions. [2021-11-23 00:39:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 00:39:23,720 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:23,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:23,814 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:39:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 349 states and 483 transitions. [2021-11-23 00:39:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 483 transitions. [2021-11-23 00:39:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 00:39:24,055 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:24,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 351 states and 486 transitions. [2021-11-23 00:39:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 486 transitions. [2021-11-23 00:39:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 00:39:24,453 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:24,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:24,507 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:39:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 365 states and 502 transitions. [2021-11-23 00:39:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 502 transitions. [2021-11-23 00:39:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 00:39:24,877 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:24,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:24,963 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:39:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 372 states and 509 transitions. [2021-11-23 00:39:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 509 transitions. [2021-11-23 00:39:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-23 00:39:25,346 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:25,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 378 states and 515 transitions. [2021-11-23 00:39:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 515 transitions. [2021-11-23 00:39:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 00:39:25,508 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:25,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 382 states and 519 transitions. [2021-11-23 00:39:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 519 transitions. [2021-11-23 00:39:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 00:39:25,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:25,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 388 states and 525 transitions. [2021-11-23 00:39:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 525 transitions. [2021-11-23 00:39:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 00:39:26,010 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:26,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:26,070 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:39:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 402 states and 541 transitions. [2021-11-23 00:39:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 541 transitions. [2021-11-23 00:39:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-23 00:39:26,188 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:26,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 441 states and 591 transitions. [2021-11-23 00:39:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 591 transitions. [2021-11-23 00:39:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 00:39:27,614 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:27,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:27,659 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:39:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 469 states and 623 transitions. [2021-11-23 00:39:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 623 transitions. [2021-11-23 00:39:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 00:39:28,617 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:28,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:28,764 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:39:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 503 states and 678 transitions. [2021-11-23 00:39:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 678 transitions. [2021-11-23 00:39:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 00:39:30,186 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:30,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:30,259 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:39:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 515 states and 692 transitions. [2021-11-23 00:39:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 692 transitions. [2021-11-23 00:39:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-23 00:39:31,010 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:31,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 542 states and 726 transitions. [2021-11-23 00:39:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 726 transitions. [2021-11-23 00:39:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-23 00:39:32,128 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:32,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 553 states and 739 transitions. [2021-11-23 00:39:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 739 transitions. [2021-11-23 00:39:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 00:39:32,805 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:32,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:32,875 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:39:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 585 states and 775 transitions. [2021-11-23 00:39:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 775 transitions. [2021-11-23 00:39:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 00:39:33,536 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:33,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:33,598 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:39:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 590 states and 783 transitions. [2021-11-23 00:39:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 783 transitions. [2021-11-23 00:39:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-23 00:39:34,225 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:34,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 00:39:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 596 states and 789 transitions. [2021-11-23 00:39:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 789 transitions. [2021-11-23 00:39:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-23 00:39:34,350 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:34,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:39:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 609 states and 802 transitions. [2021-11-23 00:39:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 802 transitions. [2021-11-23 00:39:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-23 00:39:34,499 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:34,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:34,552 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:39:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 610 states and 803 transitions. [2021-11-23 00:39:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 803 transitions. [2021-11-23 00:39:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-23 00:39:34,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:34,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 620 states and 817 transitions. [2021-11-23 00:39:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 817 transitions. [2021-11-23 00:39:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-23 00:39:35,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:35,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 625 states and 822 transitions. [2021-11-23 00:39:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 822 transitions. [2021-11-23 00:39:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-23 00:39:36,134 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:36,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 00:39:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 638 states and 836 transitions. [2021-11-23 00:39:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 836 transitions. [2021-11-23 00:39:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-23 00:39:36,575 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:36,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 644 states and 845 transitions. [2021-11-23 00:39:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 845 transitions. [2021-11-23 00:39:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-23 00:39:37,039 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:37,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 653 states and 858 transitions. [2021-11-23 00:39:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 858 transitions. [2021-11-23 00:39:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-23 00:39:37,387 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:37,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-23 00:39:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 737 states and 945 transitions. [2021-11-23 00:39:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 945 transitions. [2021-11-23 00:39:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-23 00:39:38,305 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:38,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:39:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 752 states and 958 transitions. [2021-11-23 00:39:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 958 transitions. [2021-11-23 00:39:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-23 00:39:38,750 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:38,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 766 states and 975 transitions. [2021-11-23 00:39:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 975 transitions. [2021-11-23 00:39:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-23 00:39:39,550 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:39,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:39,710 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:39:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 816 states and 1044 transitions. [2021-11-23 00:39:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1044 transitions. [2021-11-23 00:39:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-23 00:39:42,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:42,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:39:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 823 states and 1055 transitions. [2021-11-23 00:39:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1055 transitions. [2021-11-23 00:39:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-23 00:39:42,830 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:42,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:39:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 828 states and 1061 transitions. [2021-11-23 00:39:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1061 transitions. [2021-11-23 00:39:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 00:39:43,371 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:43,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:39:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 833 states and 1066 transitions. [2021-11-23 00:39:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1066 transitions. [2021-11-23 00:39:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 00:39:43,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:43,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:39:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 844 states and 1080 transitions. [2021-11-23 00:39:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1080 transitions. [2021-11-23 00:39:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 00:39:44,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:44,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:39:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 850 states and 1089 transitions. [2021-11-23 00:39:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1089 transitions. [2021-11-23 00:39:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-23 00:39:45,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:45,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 858 states and 1098 transitions. [2021-11-23 00:39:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1098 transitions. [2021-11-23 00:39:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 00:39:45,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:45,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 00:39:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 906 states and 1149 transitions. [2021-11-23 00:39:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1149 transitions. [2021-11-23 00:39:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-23 00:39:46,465 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:46,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 00:39:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 914 states and 1158 transitions. [2021-11-23 00:39:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1158 transitions. [2021-11-23 00:39:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-23 00:39:46,750 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:46,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:39:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 919 states and 1164 transitions. [2021-11-23 00:39:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1164 transitions. [2021-11-23 00:39:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-23 00:39:46,872 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:46,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1059 states and 1314 transitions. [2021-11-23 00:39:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1314 transitions. [2021-11-23 00:39:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-23 00:39:49,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:49,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-23 00:39:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1060 states and 1314 transitions. [2021-11-23 00:39:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1314 transitions. [2021-11-23 00:39:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-23 00:39:49,846 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:49,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1099 states and 1386 transitions. [2021-11-23 00:39:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1386 transitions. [2021-11-23 00:39:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-23 00:39:51,842 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:51,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 00:39:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1106 states and 1398 transitions. [2021-11-23 00:39:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1398 transitions. [2021-11-23 00:39:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-23 00:39:52,312 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:52,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 00:39:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1113 states and 1405 transitions. [2021-11-23 00:39:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1405 transitions. [2021-11-23 00:39:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-23 00:39:52,865 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:52,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 00:39:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1140 states and 1437 transitions. [2021-11-23 00:39:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1437 transitions. [2021-11-23 00:39:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-23 00:39:54,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:54,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1166 states and 1465 transitions. [2021-11-23 00:39:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1465 transitions. [2021-11-23 00:39:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:39:55,699 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:55,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1178 states and 1481 transitions. [2021-11-23 00:39:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1481 transitions. [2021-11-23 00:39:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:39:57,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:57,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1197 states and 1508 transitions. [2021-11-23 00:39:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1508 transitions. [2021-11-23 00:39:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:39:57,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:57,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1203 states and 1517 transitions. [2021-11-23 00:39:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1517 transitions. [2021-11-23 00:39:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:39:58,287 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:58,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:39:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1216 states and 1532 transitions. [2021-11-23 00:39:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1532 transitions. [2021-11-23 00:39:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:39:58,866 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:58,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:40:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1287 states and 1603 transitions. [2021-11-23 00:40:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1603 transitions. [2021-11-23 00:40:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:40:00,566 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:00,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:00,625 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:40:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1295 states and 1611 transitions. [2021-11-23 00:40:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1611 transitions. [2021-11-23 00:40:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-23 00:40:00,910 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:00,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:00,962 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:40:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1299 states and 1614 transitions. [2021-11-23 00:40:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1614 transitions. [2021-11-23 00:40:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-23 00:40:01,390 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:01,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-23 00:40:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1307 states and 1622 transitions. [2021-11-23 00:40:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1622 transitions. [2021-11-23 00:40:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 00:40:02,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:02,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 00:40:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1332 states and 1655 transitions. [2021-11-23 00:40:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1655 transitions. [2021-11-23 00:40:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 00:40:03,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:03,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 00:40:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1339 states and 1662 transitions. [2021-11-23 00:40:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1662 transitions. [2021-11-23 00:40:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 00:40:04,196 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:04,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-23 00:40:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1353 states and 1676 transitions. [2021-11-23 00:40:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1676 transitions. [2021-11-23 00:40:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 00:40:04,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:04,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1384 states and 1711 transitions. [2021-11-23 00:40:06,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1711 transitions. [2021-11-23 00:40:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 00:40:06,371 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:06,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1397 states and 1724 transitions. [2021-11-23 00:40:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1724 transitions. [2021-11-23 00:40:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 00:40:07,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:07,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:40:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1401 states and 1732 transitions. [2021-11-23 00:40:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1732 transitions. [2021-11-23 00:40:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 00:40:07,730 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:07,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:40:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1410 states and 1745 transitions. [2021-11-23 00:40:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1745 transitions. [2021-11-23 00:40:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 00:40:08,501 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:08,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-23 00:40:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1424 states and 1763 transitions. [2021-11-23 00:40:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1763 transitions. [2021-11-23 00:40:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 00:40:09,465 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:09,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:40:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1437 states and 1778 transitions. [2021-11-23 00:40:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1778 transitions. [2021-11-23 00:40:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 00:40:10,136 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:10,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:40:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1441 states and 1781 transitions. [2021-11-23 00:40:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1781 transitions. [2021-11-23 00:40:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 00:40:10,539 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:10,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 00:40:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1453 states and 1792 transitions. [2021-11-23 00:40:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1792 transitions. [2021-11-23 00:40:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-23 00:40:11,162 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:11,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:40:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1466 states and 1813 transitions. [2021-11-23 00:40:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1813 transitions. [2021-11-23 00:40:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-23 00:40:12,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:12,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:40:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1471 states and 1818 transitions. [2021-11-23 00:40:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1818 transitions. [2021-11-23 00:40:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-11-23 00:40:13,122 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:13,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:40:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1485 states and 1832 transitions. [2021-11-23 00:40:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1832 transitions. [2021-11-23 00:40:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-23 00:40:13,800 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:13,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 00:40:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1510 states and 1860 transitions. [2021-11-23 00:40:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1860 transitions. [2021-11-23 00:40:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-23 00:40:14,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:14,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 00:40:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1528 states and 1877 transitions. [2021-11-23 00:40:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1877 transitions. [2021-11-23 00:40:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-23 00:40:15,815 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:15,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:40:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1546 states and 1896 transitions. [2021-11-23 00:40:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1896 transitions. [2021-11-23 00:40:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-23 00:40:17,027 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:17,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:40:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1551 states and 1901 transitions. [2021-11-23 00:40:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1901 transitions. [2021-11-23 00:40:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-23 00:40:17,544 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:17,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 00:40:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1579 states and 1933 transitions. [2021-11-23 00:40:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1933 transitions. [2021-11-23 00:40:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-23 00:40:18,655 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:18,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:40:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1591 states and 1949 transitions. [2021-11-23 00:40:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1949 transitions. [2021-11-23 00:40:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-23 00:40:19,557 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:19,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:40:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1620 states and 1980 transitions. [2021-11-23 00:40:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1980 transitions. [2021-11-23 00:40:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-23 00:40:21,116 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:21,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:40:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1624 states and 1983 transitions. [2021-11-23 00:40:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1983 transitions. [2021-11-23 00:40:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-23 00:40:21,570 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:21,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:40:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1637 states and 1999 transitions. [2021-11-23 00:40:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 1999 transitions. [2021-11-23 00:40:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-23 00:40:23,305 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:23,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:40:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1642 states and 2004 transitions. [2021-11-23 00:40:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2004 transitions. [2021-11-23 00:40:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-23 00:40:23,731 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:23,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 00:40:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1670 states and 2033 transitions. [2021-11-23 00:40:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2033 transitions. [2021-11-23 00:40:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-23 00:40:24,430 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:24,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-23 00:40:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1674 states and 2036 transitions. [2021-11-23 00:40:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2036 transitions. [2021-11-23 00:40:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-23 00:40:24,902 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:24,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 00:40:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 1679 states and 2041 transitions. [2021-11-23 00:40:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2041 transitions. [2021-11-23 00:40:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-23 00:40:25,215 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:25,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-23 00:40:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 1688 states and 2050 transitions. [2021-11-23 00:40:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2050 transitions. [2021-11-23 00:40:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-23 00:40:25,702 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:25,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-23 00:40:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1701 states and 2063 transitions. [2021-11-23 00:40:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2063 transitions. [2021-11-23 00:40:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-23 00:40:26,210 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:26,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:40:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1713 states and 2079 transitions. [2021-11-23 00:40:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2079 transitions. [2021-11-23 00:40:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-23 00:40:27,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:27,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:40:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 1747 states and 2114 transitions. [2021-11-23 00:40:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2114 transitions. [2021-11-23 00:40:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 00:40:29,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:29,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:40:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 1752 states and 2119 transitions. [2021-11-23 00:40:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2119 transitions. [2021-11-23 00:40:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 00:40:29,439 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:29,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1847 states and 2251 transitions. [2021-11-23 00:40:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2251 transitions. [2021-11-23 00:40:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 00:40:35,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:35,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 1876 states and 2285 transitions. [2021-11-23 00:40:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2285 transitions. [2021-11-23 00:40:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 00:40:38,598 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:38,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 133 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 1881 states and 2289 transitions. [2021-11-23 00:40:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2289 transitions. [2021-11-23 00:40:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-23 00:40:39,189 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:39,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:40:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 1904 states and 2310 transitions. [2021-11-23 00:40:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2310 transitions. [2021-11-23 00:40:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-23 00:40:40,103 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:40,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-23 00:40:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 1916 states and 2322 transitions. [2021-11-23 00:40:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2322 transitions. [2021-11-23 00:40:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:40:40,688 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:40,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:40:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 1932 states and 2340 transitions. [2021-11-23 00:40:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2340 transitions. [2021-11-23 00:40:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-23 00:40:41,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:41,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 1963 states and 2376 transitions. [2021-11-23 00:40:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2376 transitions. [2021-11-23 00:40:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-23 00:40:45,062 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:45,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 1972 states and 2384 transitions. [2021-11-23 00:40:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2384 transitions. [2021-11-23 00:40:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-23 00:40:45,702 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:45,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-11-23 00:40:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 1996 states and 2410 transitions. [2021-11-23 00:40:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2410 transitions. [2021-11-23 00:40:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-23 00:40:46,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:46,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2024 states and 2461 transitions. [2021-11-23 00:40:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2461 transitions. [2021-11-23 00:40:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-23 00:40:51,084 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:51,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2050 states and 2500 transitions. [2021-11-23 00:40:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2500 transitions. [2021-11-23 00:40:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-23 00:40:55,223 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:55,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2058 states and 2515 transitions. [2021-11-23 00:40:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2515 transitions. [2021-11-23 00:40:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-23 00:40:56,516 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:56,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 145 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:40:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2069 states and 2528 transitions. [2021-11-23 00:40:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2528 transitions. [2021-11-23 00:40:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-23 00:40:58,413 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:58,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-23 00:40:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:40:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2074 states and 2532 transitions. [2021-11-23 00:40:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2532 transitions. [2021-11-23 00:40:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-23 00:40:59,261 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:40:59,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:40:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:40:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-23 00:41:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2080 states and 2541 transitions. [2021-11-23 00:41:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2541 transitions. [2021-11-23 00:41:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-23 00:41:00,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:00,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-23 00:41:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2081 states and 2542 transitions. [2021-11-23 00:41:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2542 transitions. [2021-11-23 00:41:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-23 00:41:01,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:01,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:41:01,314 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:41:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:41:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:41:01,608 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:41:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:41:01,772 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 117 iterations. [2021-11-23 00:41:02,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:41:02 ImpRootNode [2021-11-23 00:41:02,194 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 00:41:02,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 00:41:02,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 00:41:02,195 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 00:41:02,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:15" (3/4) ... [2021-11-23 00:41:02,198 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 00:41:02,468 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 00:41:02,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 00:41:02,470 INFO L158 Benchmark]: Toolchain (without parser) took 109860.43ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 979.4MB). Free memory was 78.3MB in the beginning and 565.9MB in the end (delta: -487.7MB). Peak memory consumption was 491.4MB. Max. memory is 16.1GB. [2021-11-23 00:41:02,471 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:41:02,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 797.35ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 74.9MB in the end (delta: 3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 00:41:02,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.41ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 69.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 00:41:02,473 INFO L158 Benchmark]: Boogie Preprocessor took 106.03ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 64.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:41:02,473 INFO L158 Benchmark]: RCFGBuilder took 1913.17ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 64.9MB in the beginning and 106.2MB in the end (delta: -41.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2021-11-23 00:41:02,474 INFO L158 Benchmark]: CodeCheck took 106637.25ms. Allocated memory was 146.8MB in the beginning and 1.1GB in the end (delta: 950.0MB). Free memory was 105.3MB in the beginning and 593.0MB in the end (delta: -487.7MB). Peak memory consumption was 462.9MB. Max. memory is 16.1GB. [2021-11-23 00:41:02,474 INFO L158 Benchmark]: Witness Printer took 274.54ms. Allocated memory is still 1.1GB. Free memory was 593.0MB in the beginning and 565.9MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-23 00:41:02,477 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: 106.2s, OverallIterations: 117, 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, 257576 SdHoareTripleChecker+Valid, 722.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253893 mSDsluCounter, 39026 SdHoareTripleChecker+Invalid, 595.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33108 mSDsCounter, 69576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 565959 IncrementalHoareTripleChecker+Invalid, 635535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69576 mSolverCounterUnsat, 5918 mSDtfsCounter, 565959 mSolverCounterSat, 7.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112753 GetRequests, 108974 SyntacticMatches, 2805 SemanticMatches, 974 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549162 ImplicationChecksByTransitivity, 81.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 16815 NumberOfCodeBlocks, 16815 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 16500 ConstructedInterpolants, 0 QuantifiedInterpolants, 52659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 106 PerfectInterpolantSequences, 11676/12145 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: 423]: 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 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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=1, a20=1, 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 FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, 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, input=3, 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)=3, 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, input=3, 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)=3, 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, input=3, 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)=3, 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, input=3, 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)=3, 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, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, 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] [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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, 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=6, 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] [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=6, 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] [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=6, 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] [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=6, 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] [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=6, 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] [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=6, 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] [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=6, 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] [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=6, 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] [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=6, 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] [L94] COND TRUE ((((((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)) [L95] a7 = 0 [L96] a20 = 1 [L97] a8 = 14 [L98] a16 = 4 [L99] a21 = 1 [L100] a17 = 0 [L101] return -1; VAL [\old(input)=2, \result=-1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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=1, a21=1, a7=0, a8=14, 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))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L423] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, 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.42ms. Allocated memory is still 117.4MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 797.35ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 74.9MB in the end (delta: 3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.41ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 69.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.03ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 64.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1913.17ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 64.9MB in the beginning and 106.2MB in the end (delta: -41.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * CodeCheck took 106637.25ms. Allocated memory was 146.8MB in the beginning and 1.1GB in the end (delta: 950.0MB). Free memory was 105.3MB in the beginning and 593.0MB in the end (delta: -487.7MB). Peak memory consumption was 462.9MB. Max. memory is 16.1GB. * Witness Printer took 274.54ms. Allocated memory is still 1.1GB. Free memory was 593.0MB in the beginning and 565.9MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 00:41:02,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ba9a411-b17f-4f05-9702-a2a5d608df06/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