./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_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_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/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_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/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_e1eb321c-02f2-4b8f-a717-23081b481d43/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 55cfdf74604724371a452c38b03dd4e25c32928e3cf25773bd571d9975e54b78 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:23:24,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:23:24,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:23:25,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:23:25,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:23:25,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:23:25,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:23:25,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:23:25,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:23:25,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:23:25,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:23:25,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:23:25,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:23:25,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:23:25,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:23:25,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:23:25,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:23:25,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:23:25,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:23:25,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:23:25,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:23:25,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:23:25,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:23:25,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:23:25,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:23:25,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:23:25,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:23:25,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:23:25,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:23:25,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:23:25,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:23:25,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:23:25,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:23:25,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:23:25,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:23:25,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:23:25,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:23:25,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:23:25,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:23:25,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:23:25,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:23:25,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:23:25,143 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:23:25,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:23:25,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:23:25,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:23:25,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:23:25,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:23:25,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:23:25,146 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:23:25,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:23:25,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:23:25,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:23:25,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:23:25,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:23:25,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:23:25,148 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:23:25,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:23:25,148 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:23:25,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:23:25,149 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:23:25,149 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:23:25,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:23:25,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:23:25,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:23:25,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:23:25,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:23:25,150 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:23:25,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:23:25,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:23:25,151 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_e1eb321c-02f2-4b8f-a717-23081b481d43/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_e1eb321c-02f2-4b8f-a717-23081b481d43/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 -> 55cfdf74604724371a452c38b03dd4e25c32928e3cf25773bd571d9975e54b78 [2021-11-23 00:23:25,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:23:25,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:23:25,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:23:25,452 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:23:25,452 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:23:25,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2021-11-23 00:23:25,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/data/c89f75933/51d2be6904614901a4ba6e7ba805d98e/FLAG3ec8acfa2 [2021-11-23 00:23:26,153 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:23:26,154 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2021-11-23 00:23:26,170 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/data/c89f75933/51d2be6904614901a4ba6e7ba805d98e/FLAG3ec8acfa2 [2021-11-23 00:23:26,372 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/data/c89f75933/51d2be6904614901a4ba6e7ba805d98e [2021-11-23 00:23:26,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:23:26,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:23:26,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:23:26,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:23:26,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:23:26,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:26,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6485e010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26, skipping insertion in model container [2021-11-23 00:23:26,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:26,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:23:26,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:23:26,762 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_e1eb321c-02f2-4b8f-a717-23081b481d43/sv-benchmarks/c/eca-rers2012/Problem02_label50.c[14631,14644] [2021-11-23 00:23:26,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:23:26,825 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:23:26,943 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_e1eb321c-02f2-4b8f-a717-23081b481d43/sv-benchmarks/c/eca-rers2012/Problem02_label50.c[14631,14644] [2021-11-23 00:23:26,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:23:26,981 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:23:26,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26 WrapperNode [2021-11-23 00:23:26,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:23:26,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:23:26,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:23:26,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:23:26,991 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:23:26" (1/1) ... [2021-11-23 00:23:27,017 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:23:26" (1/1) ... [2021-11-23 00:23:27,087 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2021-11-23 00:23:27,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:23:27,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:23:27,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:23:27,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:23:27,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:23:27,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:23:27,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:23:27,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:23:27,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:26" (1/1) ... [2021-11-23 00:23:27,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:23:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:23:27,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:23:27,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:23:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:23:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:23:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:23:27,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:23:27,347 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:23:27,348 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:23:28,404 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:23:28,665 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:23:28,666 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 00:23:28,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:28 BoogieIcfgContainer [2021-11-23 00:23:28,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:23:28,672 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:23:28,672 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:23:28,682 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:23:28,683 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:28" (1/1) ... [2021-11-23 00:23:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:23:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2021-11-23 00:23:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2021-11-23 00:23:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-23 00:23:28,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:28,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:29,125 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:23:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 163 states and 295 transitions. [2021-11-23 00:23:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 295 transitions. [2021-11-23 00:23:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 00:23:29,707 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:29,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:29,796 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:23:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 166 states and 300 transitions. [2021-11-23 00:23:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 300 transitions. [2021-11-23 00:23:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-23 00:23:29,865 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:29,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 245 states and 382 transitions. [2021-11-23 00:23:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2021-11-23 00:23:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-23 00:23:30,837 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:30,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:30,884 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:23:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 250 states and 391 transitions. [2021-11-23 00:23:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 391 transitions. [2021-11-23 00:23:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 00:23:31,052 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:31,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:31,131 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:23:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 253 states and 395 transitions. [2021-11-23 00:23:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 395 transitions. [2021-11-23 00:23:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-23 00:23:31,207 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:31,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 257 states and 403 transitions. [2021-11-23 00:23:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2021-11-23 00:23:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-23 00:23:31,535 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:31,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 266 states and 416 transitions. [2021-11-23 00:23:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 416 transitions. [2021-11-23 00:23:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-23 00:23:31,846 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:31,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 269 states and 424 transitions. [2021-11-23 00:23:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 424 transitions. [2021-11-23 00:23:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-23 00:23:32,157 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:32,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 272 states and 430 transitions. [2021-11-23 00:23:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 430 transitions. [2021-11-23 00:23:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-23 00:23:32,405 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:32,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 274 states and 431 transitions. [2021-11-23 00:23:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 431 transitions. [2021-11-23 00:23:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-23 00:23:32,554 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:32,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 278 states and 438 transitions. [2021-11-23 00:23:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 438 transitions. [2021-11-23 00:23:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-23 00:23:32,952 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:32,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:32,978 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:23:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 281 states and 441 transitions. [2021-11-23 00:23:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 441 transitions. [2021-11-23 00:23:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-23 00:23:33,013 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:33,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:23:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 288 states and 453 transitions. [2021-11-23 00:23:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 453 transitions. [2021-11-23 00:23:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-23 00:23:33,568 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:33,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:23:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 290 states and 454 transitions. [2021-11-23 00:23:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 454 transitions. [2021-11-23 00:23:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-23 00:23:33,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:33,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 291 states and 455 transitions. [2021-11-23 00:23:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 455 transitions. [2021-11-23 00:23:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-23 00:23:33,864 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:33,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 293 states and 457 transitions. [2021-11-23 00:23:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 457 transitions. [2021-11-23 00:23:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-23 00:23:33,914 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:33,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:23:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 306 states and 474 transitions. [2021-11-23 00:23:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 474 transitions. [2021-11-23 00:23:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-23 00:23:34,129 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:34,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:34,161 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:23:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 313 states and 481 transitions. [2021-11-23 00:23:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 481 transitions. [2021-11-23 00:23:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 00:23:34,213 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:34,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 00:23:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 314 states and 482 transitions. [2021-11-23 00:23:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 482 transitions. [2021-11-23 00:23:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 00:23:34,384 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:34,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 331 states and 502 transitions. [2021-11-23 00:23:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 502 transitions. [2021-11-23 00:23:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-23 00:23:34,618 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:34,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 355 states and 532 transitions. [2021-11-23 00:23:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 532 transitions. [2021-11-23 00:23:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-23 00:23:35,322 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:35,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 357 states and 535 transitions. [2021-11-23 00:23:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 535 transitions. [2021-11-23 00:23:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-23 00:23:35,467 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:35,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 363 states and 543 transitions. [2021-11-23 00:23:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 543 transitions. [2021-11-23 00:23:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 00:23:35,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:35,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 387 states and 575 transitions. [2021-11-23 00:23:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2021-11-23 00:23:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 00:23:37,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:37,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 410 states and 601 transitions. [2021-11-23 00:23:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2021-11-23 00:23:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 00:23:37,508 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:37,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 412 states and 602 transitions. [2021-11-23 00:23:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 602 transitions. [2021-11-23 00:23:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 00:23:37,772 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:37,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:23:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 436 states and 633 transitions. [2021-11-23 00:23:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 633 transitions. [2021-11-23 00:23:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 00:23:38,952 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:38,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:23:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 438 states and 634 transitions. [2021-11-23 00:23:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 634 transitions. [2021-11-23 00:23:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-23 00:23:39,193 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:39,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 517 states and 732 transitions. [2021-11-23 00:23:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 732 transitions. [2021-11-23 00:23:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-23 00:23:40,068 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:40,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 549 states and 771 transitions. [2021-11-23 00:23:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 771 transitions. [2021-11-23 00:23:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-23 00:23:41,369 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:41,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:41,404 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:23:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 558 states and 782 transitions. [2021-11-23 00:23:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 782 transitions. [2021-11-23 00:23:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-23 00:23:41,500 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:41,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:41,536 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:23:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 559 states and 783 transitions. [2021-11-23 00:23:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 783 transitions. [2021-11-23 00:23:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 00:23:41,574 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:41,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 587 states and 815 transitions. [2021-11-23 00:23:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 815 transitions. [2021-11-23 00:23:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 00:23:42,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:42,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 589 states and 816 transitions. [2021-11-23 00:23:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 816 transitions. [2021-11-23 00:23:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 00:23:42,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:42,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:23:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 597 states and 832 transitions. [2021-11-23 00:23:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 832 transitions. [2021-11-23 00:23:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 00:23:43,265 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:43,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:23:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 602 states and 842 transitions. [2021-11-23 00:23:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 842 transitions. [2021-11-23 00:23:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 00:23:43,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:43,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:23:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 611 states and 852 transitions. [2021-11-23 00:23:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 852 transitions. [2021-11-23 00:23:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 00:23:43,994 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:43,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:23:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 612 states and 853 transitions. [2021-11-23 00:23:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 853 transitions. [2021-11-23 00:23:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-23 00:23:44,151 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:23:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 614 states and 854 transitions. [2021-11-23 00:23:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 854 transitions. [2021-11-23 00:23:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-23 00:23:44,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 615 states and 855 transitions. [2021-11-23 00:23:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 855 transitions. [2021-11-23 00:23:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-23 00:23:44,496 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 00:23:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 618 states and 858 transitions. [2021-11-23 00:23:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 858 transitions. [2021-11-23 00:23:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-23 00:23:44,602 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 00:23:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 620 states and 860 transitions. [2021-11-23 00:23:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 860 transitions. [2021-11-23 00:23:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-23 00:23:44,679 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:44,711 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:23:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 636 states and 878 transitions. [2021-11-23 00:23:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 878 transitions. [2021-11-23 00:23:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-23 00:23:44,807 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:23:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 637 states and 879 transitions. [2021-11-23 00:23:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 879 transitions. [2021-11-23 00:23:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-23 00:23:44,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:44,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:45,003 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:23:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 716 states and 962 transitions. [2021-11-23 00:23:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 962 transitions. [2021-11-23 00:23:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-23 00:23:45,778 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:45,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 729 states and 976 transitions. [2021-11-23 00:23:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2021-11-23 00:23:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-23 00:23:45,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:45,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 00:23:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 753 states and 1010 transitions. [2021-11-23 00:23:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1010 transitions. [2021-11-23 00:23:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-23 00:23:46,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:46,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 00:23:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 766 states and 1025 transitions. [2021-11-23 00:23:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1025 transitions. [2021-11-23 00:23:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-23 00:23:47,343 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:47,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-23 00:23:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 790 states and 1052 transitions. [2021-11-23 00:23:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1052 transitions. [2021-11-23 00:23:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-23 00:23:47,770 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:47,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 792 states and 1054 transitions. [2021-11-23 00:23:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1054 transitions. [2021-11-23 00:23:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-23 00:23:48,087 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:48,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 795 states and 1057 transitions. [2021-11-23 00:23:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1057 transitions. [2021-11-23 00:23:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-23 00:23:48,369 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:48,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 845 states and 1123 transitions. [2021-11-23 00:23:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1123 transitions. [2021-11-23 00:23:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-23 00:23:51,463 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:51,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 859 states and 1135 transitions. [2021-11-23 00:23:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1135 transitions. [2021-11-23 00:23:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 00:23:52,339 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:52,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 868 states and 1148 transitions. [2021-11-23 00:23:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1148 transitions. [2021-11-23 00:23:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-23 00:23:53,706 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:53,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:23:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 870 states and 1149 transitions. [2021-11-23 00:23:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1149 transitions. [2021-11-23 00:23:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 00:23:54,025 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:54,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 00:23:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 877 states and 1156 transitions. [2021-11-23 00:23:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1156 transitions. [2021-11-23 00:23:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 00:23:54,114 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:54,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 00:23:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 888 states and 1174 transitions. [2021-11-23 00:23:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1174 transitions. [2021-11-23 00:23:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 00:23:54,930 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:54,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 00:23:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 893 states and 1183 transitions. [2021-11-23 00:23:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1183 transitions. [2021-11-23 00:23:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 00:23:55,468 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:55,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 00:23:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 894 states and 1184 transitions. [2021-11-23 00:23:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1184 transitions. [2021-11-23 00:23:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-23 00:23:55,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:55,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 00:23:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 896 states and 1185 transitions. [2021-11-23 00:23:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1185 transitions. [2021-11-23 00:23:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-23 00:23:55,872 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:55,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 00:23:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 898 states and 1188 transitions. [2021-11-23 00:23:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1188 transitions. [2021-11-23 00:23:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-23 00:23:56,207 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:56,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 00:23:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 912 states and 1202 transitions. [2021-11-23 00:23:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1202 transitions. [2021-11-23 00:23:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-23 00:23:56,859 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:56,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 00:23:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 916 states and 1206 transitions. [2021-11-23 00:23:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1206 transitions. [2021-11-23 00:23:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-23 00:23:56,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:56,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:23:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 925 states and 1216 transitions. [2021-11-23 00:23:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1216 transitions. [2021-11-23 00:23:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-23 00:23:57,895 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:57,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:23:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 971 states and 1271 transitions. [2021-11-23 00:23:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1271 transitions. [2021-11-23 00:23:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-23 00:23:58,227 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:58,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 00:23:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:23:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 986 states and 1286 transitions. [2021-11-23 00:23:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1286 transitions. [2021-11-23 00:23:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-23 00:23:59,176 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:23:59,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:23:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:23:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1009 states and 1312 transitions. [2021-11-23 00:24:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1312 transitions. [2021-11-23 00:24:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-23 00:24:00,393 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:00,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1012 states and 1315 transitions. [2021-11-23 00:24:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1315 transitions. [2021-11-23 00:24:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-23 00:24:00,463 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:00,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1056 states and 1366 transitions. [2021-11-23 00:24:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1366 transitions. [2021-11-23 00:24:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-23 00:24:02,170 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:02,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-23 00:24:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1098 states and 1414 transitions. [2021-11-23 00:24:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1414 transitions. [2021-11-23 00:24:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-23 00:24:03,369 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:03,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1107 states and 1428 transitions. [2021-11-23 00:24:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1428 transitions. [2021-11-23 00:24:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-23 00:24:03,467 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:03,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1139 states and 1465 transitions. [2021-11-23 00:24:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1465 transitions. [2021-11-23 00:24:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 00:24:04,404 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:04,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1162 states and 1489 transitions. [2021-11-23 00:24:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1489 transitions. [2021-11-23 00:24:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-23 00:24:04,600 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:04,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1189 states and 1518 transitions. [2021-11-23 00:24:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1518 transitions. [2021-11-23 00:24:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-23 00:24:04,835 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:04,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1198 states and 1529 transitions. [2021-11-23 00:24:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1529 transitions. [2021-11-23 00:24:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-23 00:24:04,944 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:04,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1203 states and 1536 transitions. [2021-11-23 00:24:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1536 transitions. [2021-11-23 00:24:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-23 00:24:05,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:05,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1218 states and 1552 transitions. [2021-11-23 00:24:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1552 transitions. [2021-11-23 00:24:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 00:24:06,410 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:06,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-23 00:24:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1225 states and 1559 transitions. [2021-11-23 00:24:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1559 transitions. [2021-11-23 00:24:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 00:24:06,737 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:06,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:06,779 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:24:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:07,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1262 states and 1602 transitions. [2021-11-23 00:24:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1602 transitions. [2021-11-23 00:24:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 00:24:07,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:07,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:07,745 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:24:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1273 states and 1613 transitions. [2021-11-23 00:24:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1613 transitions. [2021-11-23 00:24:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 00:24:07,856 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:07,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:24:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1298 states and 1641 transitions. [2021-11-23 00:24:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1641 transitions. [2021-11-23 00:24:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 00:24:08,145 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:08,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:24:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1309 states and 1652 transitions. [2021-11-23 00:24:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1652 transitions. [2021-11-23 00:24:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 00:24:08,278 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:08,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1331 states and 1675 transitions. [2021-11-23 00:24:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1675 transitions. [2021-11-23 00:24:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 00:24:09,338 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:09,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-23 00:24:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1333 states and 1697 transitions. [2021-11-23 00:24:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1697 transitions. [2021-11-23 00:24:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 00:24:09,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:09,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-23 00:24:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1353 states and 1720 transitions. [2021-11-23 00:24:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1720 transitions. [2021-11-23 00:24:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 00:24:10,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:10,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-23 00:24:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1359 states and 1726 transitions. [2021-11-23 00:24:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1726 transitions. [2021-11-23 00:24:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 00:24:10,520 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:10,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-23 00:24:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1369 states and 1735 transitions. [2021-11-23 00:24:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1735 transitions. [2021-11-23 00:24:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 00:24:10,953 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:10,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-23 00:24:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1376 states and 1746 transitions. [2021-11-23 00:24:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1746 transitions. [2021-11-23 00:24:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 00:24:11,357 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:11,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 00:24:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1382 states and 1755 transitions. [2021-11-23 00:24:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1755 transitions. [2021-11-23 00:24:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-23 00:24:12,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:12,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-23 00:24:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1386 states and 1759 transitions. [2021-11-23 00:24:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1759 transitions. [2021-11-23 00:24:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-23 00:24:12,582 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:12,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-23 00:24:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1389 states and 1765 transitions. [2021-11-23 00:24:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1765 transitions. [2021-11-23 00:24:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-23 00:24:13,155 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:13,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-23 00:24:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1414 states and 1792 transitions. [2021-11-23 00:24:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1792 transitions. [2021-11-23 00:24:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-23 00:24:13,926 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:13,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1483 states and 1871 transitions. [2021-11-23 00:24:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1871 transitions. [2021-11-23 00:24:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-23 00:24:15,338 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:15,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-23 00:24:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1484 states and 1871 transitions. [2021-11-23 00:24:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1871 transitions. [2021-11-23 00:24:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-23 00:24:15,530 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:15,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-23 00:24:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1491 states and 1879 transitions. [2021-11-23 00:24:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1879 transitions. [2021-11-23 00:24:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-23 00:24:15,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:15,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 00:24:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1537 states and 1927 transitions. [2021-11-23 00:24:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1927 transitions. [2021-11-23 00:24:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-23 00:24:17,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:17,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:24:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1543 states and 1934 transitions. [2021-11-23 00:24:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1934 transitions. [2021-11-23 00:24:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-23 00:24:17,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:17,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:24:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1547 states and 1938 transitions. [2021-11-23 00:24:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1938 transitions. [2021-11-23 00:24:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-23 00:24:17,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:17,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 00:24:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1548 states and 1938 transitions. [2021-11-23 00:24:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1938 transitions. [2021-11-23 00:24:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-23 00:24:18,371 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:18,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 00:24:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1574 states and 1968 transitions. [2021-11-23 00:24:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1968 transitions. [2021-11-23 00:24:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-23 00:24:18,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:18,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 00:24:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1606 states and 2004 transitions. [2021-11-23 00:24:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2004 transitions. [2021-11-23 00:24:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-23 00:24:19,607 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:19,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 00:24:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 1617 states and 2015 transitions. [2021-11-23 00:24:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2015 transitions. [2021-11-23 00:24:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-23 00:24:19,779 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:19,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 1629 states and 2027 transitions. [2021-11-23 00:24:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2027 transitions. [2021-11-23 00:24:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-23 00:24:20,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:20,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:24:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1633 states and 2030 transitions. [2021-11-23 00:24:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2030 transitions. [2021-11-23 00:24:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-23 00:24:20,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:20,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-23 00:24:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1641 states and 2037 transitions. [2021-11-23 00:24:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2037 transitions. [2021-11-23 00:24:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-23 00:24:20,989 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:20,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-23 00:24:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 1673 states and 2073 transitions. [2021-11-23 00:24:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2073 transitions. [2021-11-23 00:24:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-23 00:24:21,460 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:21,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 00:24:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1679 states and 2080 transitions. [2021-11-23 00:24:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2080 transitions. [2021-11-23 00:24:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-23 00:24:22,164 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:22,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 00:24:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1681 states and 2081 transitions. [2021-11-23 00:24:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2081 transitions. [2021-11-23 00:24:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-23 00:24:22,422 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:22,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1685 states and 2084 transitions. [2021-11-23 00:24:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2084 transitions. [2021-11-23 00:24:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-23 00:24:22,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:22,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:24:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1692 states and 2094 transitions. [2021-11-23 00:24:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2094 transitions. [2021-11-23 00:24:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-23 00:24:23,744 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:23,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:24:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 1736 states and 2142 transitions. [2021-11-23 00:24:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2142 transitions. [2021-11-23 00:24:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-23 00:24:25,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:25,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 00:24:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1750 states and 2158 transitions. [2021-11-23 00:24:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2158 transitions. [2021-11-23 00:24:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-23 00:24:26,548 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:26,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:24:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 1752 states and 2160 transitions. [2021-11-23 00:24:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2160 transitions. [2021-11-23 00:24:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-23 00:24:26,751 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:26,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 117 proven. 37 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-23 00:24:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1782 states and 2191 transitions. [2021-11-23 00:24:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2191 transitions. [2021-11-23 00:24:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-23 00:24:28,266 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:28,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 1787 states and 2196 transitions. [2021-11-23 00:24:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2196 transitions. [2021-11-23 00:24:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-23 00:24:28,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:28,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1846 states and 2256 transitions. [2021-11-23 00:24:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2256 transitions. [2021-11-23 00:24:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-23 00:24:29,054 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:29,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-23 00:24:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1853 states and 2265 transitions. [2021-11-23 00:24:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2265 transitions. [2021-11-23 00:24:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-23 00:24:29,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:29,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 152 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1871 states and 2287 transitions. [2021-11-23 00:24:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2287 transitions. [2021-11-23 00:24:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:30,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:30,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:24:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1896 states and 2316 transitions. [2021-11-23 00:24:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2316 transitions. [2021-11-23 00:24:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:30,563 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:30,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:24:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 1907 states and 2329 transitions. [2021-11-23 00:24:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2329 transitions. [2021-11-23 00:24:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:30,698 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:30,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:24:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 1911 states and 2333 transitions. [2021-11-23 00:24:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2333 transitions. [2021-11-23 00:24:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:30,948 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:30,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:24:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 1922 states and 2345 transitions. [2021-11-23 00:24:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2345 transitions. [2021-11-23 00:24:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:31,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:31,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 00:24:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 1924 states and 2346 transitions. [2021-11-23 00:24:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2346 transitions. [2021-11-23 00:24:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:31,693 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:31,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 1929 states and 2355 transitions. [2021-11-23 00:24:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2355 transitions. [2021-11-23 00:24:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:32,788 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:32,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 1938 states and 2365 transitions. [2021-11-23 00:24:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2365 transitions. [2021-11-23 00:24:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:32,997 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:32,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 1941 states and 2369 transitions. [2021-11-23 00:24:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2369 transitions. [2021-11-23 00:24:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-23 00:24:33,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:33,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 1943 states and 2370 transitions. [2021-11-23 00:24:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2370 transitions. [2021-11-23 00:24:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-23 00:24:33,344 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:33,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 00:24:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 1960 states and 2390 transitions. [2021-11-23 00:24:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2390 transitions. [2021-11-23 00:24:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-23 00:24:33,533 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:33,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 00:24:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 1977 states and 2406 transitions. [2021-11-23 00:24:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2406 transitions. [2021-11-23 00:24:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-23 00:24:33,842 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:33,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 00:24:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 1991 states and 2422 transitions. [2021-11-23 00:24:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2422 transitions. [2021-11-23 00:24:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-11-23 00:24:34,499 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:34,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 00:24:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2009 states and 2440 transitions. [2021-11-23 00:24:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2440 transitions. [2021-11-23 00:24:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-11-23 00:24:35,218 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:35,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-23 00:24:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2010 states and 2440 transitions. [2021-11-23 00:24:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2440 transitions. [2021-11-23 00:24:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-23 00:24:35,412 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:35,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2023 states and 2458 transitions. [2021-11-23 00:24:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2458 transitions. [2021-11-23 00:24:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-11-23 00:24:36,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:36,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2035 states and 2473 transitions. [2021-11-23 00:24:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2473 transitions. [2021-11-23 00:24:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-23 00:24:37,500 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:37,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-23 00:24:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2041 states and 2483 transitions. [2021-11-23 00:24:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2483 transitions. [2021-11-23 00:24:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-23 00:24:38,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:38,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 00:24:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2075 states and 2520 transitions. [2021-11-23 00:24:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2520 transitions. [2021-11-23 00:24:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-23 00:24:38,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:38,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 123 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2100 states and 2548 transitions. [2021-11-23 00:24:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2548 transitions. [2021-11-23 00:24:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-11-23 00:24:40,294 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:40,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 123 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2102 states and 2549 transitions. [2021-11-23 00:24:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2549 transitions. [2021-11-23 00:24:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-11-23 00:24:40,781 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:40,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-23 00:24:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2117 states and 2564 transitions. [2021-11-23 00:24:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2564 transitions. [2021-11-23 00:24:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-11-23 00:24:41,384 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:41,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2122 states and 2569 transitions. [2021-11-23 00:24:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2569 transitions. [2021-11-23 00:24:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-11-23 00:24:41,960 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:41,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 00:24:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2127 states and 2575 transitions. [2021-11-23 00:24:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2575 transitions. [2021-11-23 00:24:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-23 00:24:42,792 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:42,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 00:24:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2189 states and 2647 transitions. [2021-11-23 00:24:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2647 transitions. [2021-11-23 00:24:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-23 00:24:44,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:44,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 00:24:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2215 states and 2674 transitions. [2021-11-23 00:24:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2674 transitions. [2021-11-23 00:24:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-23 00:24:46,036 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:46,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 00:24:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2221 states and 2680 transitions. [2021-11-23 00:24:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2680 transitions. [2021-11-23 00:24:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-11-23 00:24:46,462 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:46,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 00:24:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2245 states and 2706 transitions. [2021-11-23 00:24:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2706 transitions. [2021-11-23 00:24:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-23 00:24:47,314 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:47,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:24:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2288 states and 2755 transitions. [2021-11-23 00:24:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2755 transitions. [2021-11-23 00:24:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-23 00:24:47,871 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:47,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:24:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2331 states and 2800 transitions. [2021-11-23 00:24:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2800 transitions. [2021-11-23 00:24:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-23 00:24:48,300 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:48,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 00:24:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2342 states and 2811 transitions. [2021-11-23 00:24:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 2811 transitions. [2021-11-23 00:24:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-23 00:24:48,438 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:48,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2379 states and 2848 transitions. [2021-11-23 00:24:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 2848 transitions. [2021-11-23 00:24:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-11-23 00:24:50,442 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:50,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 160 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2406 states and 2882 transitions. [2021-11-23 00:24:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2882 transitions. [2021-11-23 00:24:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-23 00:24:52,886 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:52,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2486 states and 2964 transitions. [2021-11-23 00:24:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2964 transitions. [2021-11-23 00:24:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-23 00:24:56,166 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:56,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 00:24:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2489 states and 2966 transitions. [2021-11-23 00:24:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 2966 transitions. [2021-11-23 00:24:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-23 00:24:56,772 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:56,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-23 00:24:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2495 states and 2971 transitions. [2021-11-23 00:24:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2971 transitions. [2021-11-23 00:24:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-11-23 00:24:57,003 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:57,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 00:24:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2497 states and 2973 transitions. [2021-11-23 00:24:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 2973 transitions. [2021-11-23 00:24:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-11-23 00:24:57,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:57,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:24:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-23 00:24:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:24:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2514 states and 2989 transitions. [2021-11-23 00:24:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2989 transitions. [2021-11-23 00:24:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-23 00:24:57,295 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:24:57,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:24:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:24:57,333 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:24:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:24:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:24:57,568 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 00:24:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 00:24:57,753 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 156 iterations. [2021-11-23 00:24:58,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:24:58 ImpRootNode [2021-11-23 00:24:58,013 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 00:24:58,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 00:24:58,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 00:24:58,014 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 00:24:58,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:28" (3/4) ... [2021-11-23 00:24:58,016 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 00:24:58,223 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 00:24:58,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 00:24:58,225 INFO L158 Benchmark]: Toolchain (without parser) took 91848.39ms. Allocated memory was 96.5MB in the beginning and 1.0GB in the end (delta: 929.0MB). Free memory was 62.8MB in the beginning and 692.4MB in the end (delta: -629.6MB). Peak memory consumption was 299.5MB. Max. memory is 16.1GB. [2021-11-23 00:24:58,225 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 53.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 00:24:58,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.49ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 62.8MB in the beginning and 85.7MB in the end (delta: -22.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-23 00:24:58,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.72ms. Allocated memory is still 125.8MB. Free memory was 85.7MB in the beginning and 80.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 00:24:58,227 INFO L158 Benchmark]: Boogie Preprocessor took 76.86ms. Allocated memory is still 125.8MB. Free memory was 80.0MB in the beginning and 75.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 00:24:58,227 INFO L158 Benchmark]: RCFGBuilder took 1504.67ms. Allocated memory is still 125.8MB. Free memory was 75.8MB in the beginning and 88.9MB in the end (delta: -13.1MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2021-11-23 00:24:58,228 INFO L158 Benchmark]: CodeCheck took 89341.43ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 899.7MB). Free memory was 88.9MB in the beginning and 718.6MB in the end (delta: -629.7MB). Peak memory consumption was 269.5MB. Max. memory is 16.1GB. [2021-11-23 00:24:58,228 INFO L158 Benchmark]: Witness Printer took 210.04ms. Allocated memory is still 1.0GB. Free memory was 718.6MB in the beginning and 692.4MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-23 00:24:58,231 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 89.0s, OverallIterations: 156, 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, 417315 SdHoareTripleChecker+Valid, 881.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387281 mSDsluCounter, 74721 SdHoareTripleChecker+Invalid, 717.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64934 mSDsCounter, 137787 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884468 IncrementalHoareTripleChecker+Invalid, 1022255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137787 mSolverCounterUnsat, 9787 mSDtfsCounter, 884468 mSolverCounterSat, 8.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170241 GetRequests, 166395 SyntacticMatches, 2930 SemanticMatches, 916 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512479 ImplicationChecksByTransitivity, 65.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 23621 NumberOfCodeBlocks, 23621 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 23256 ConstructedInterpolants, 0 QuantifiedInterpolants, 52726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 155 InterpolantComputations, 134 PerfectInterpolantSequences, 15148/15464 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: 425]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\old(input)=4, \result=23, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\old(input)=3, \result=25, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L65] a28 = 7 [L66] a11 = 1 [L67] a25 = 0 [L68] return -1; VAL [\old(input)=1, \result=-1, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L425] reach_error() VAL [\old(input)=4, a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, 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.31ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 53.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.49ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 62.8MB in the beginning and 85.7MB in the end (delta: -22.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.72ms. Allocated memory is still 125.8MB. Free memory was 85.7MB in the beginning and 80.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.86ms. Allocated memory is still 125.8MB. Free memory was 80.0MB in the beginning and 75.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1504.67ms. Allocated memory is still 125.8MB. Free memory was 75.8MB in the beginning and 88.9MB in the end (delta: -13.1MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * CodeCheck took 89341.43ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 899.7MB). Free memory was 88.9MB in the beginning and 718.6MB in the end (delta: -629.7MB). Peak memory consumption was 269.5MB. Max. memory is 16.1GB. * Witness Printer took 210.04ms. Allocated memory is still 1.0GB. Free memory was 718.6MB in the beginning and 692.4MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 00:24:58,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eb321c-02f2-4b8f-a717-23081b481d43/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