./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4 --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 23:32:53,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 23:32:53,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 23:32:53,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 23:32:53,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 23:32:53,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 23:32:53,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 23:32:53,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 23:32:53,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 23:32:53,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 23:32:53,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 23:32:53,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 23:32:53,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 23:32:53,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 23:32:53,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 23:32:53,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 23:32:53,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 23:32:53,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 23:32:53,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 23:32:53,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 23:32:53,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 23:32:53,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 23:32:53,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 23:32:53,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 23:32:53,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 23:32:53,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 23:32:53,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 23:32:53,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 23:32:53,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 23:32:53,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 23:32:53,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 23:32:53,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 23:32:53,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 23:32:53,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 23:32:53,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 23:32:53,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 23:32:53,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 23:32:53,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 23:32:53,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 23:32:53,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 23:32:53,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 23:32:53,604 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 23:32:53,623 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 23:32:53,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 23:32:53,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 23:32:53,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 23:32:53,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 23:32:53,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 23:32:53,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 23:32:53,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 23:32:53,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 23:32:53,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 23:32:53,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 23:32:53,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 23:32:53,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 23:32:53,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 23:32:53,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 23:32:53,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 23:32:53,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 23:32:53,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 23:32:53,636 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 23:32:53,636 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 23:32:53,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 23:32:53,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:32:53,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 23:32:53,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 23:32:53,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 23:32:53,637 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 23:32:53,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 23:32:53,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 23:32:53,638 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_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/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_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4 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 [2022-12-14 23:32:53,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 23:32:53,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 23:32:53,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 23:32:53,839 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 23:32:53,839 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 23:32:53,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2022-12-14 23:32:56,459 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 23:32:56,675 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 23:32:56,676 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2022-12-14 23:32:56,683 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/data/65ad3fdb9/e89a6e426c22413ead8efecdaed06e49/FLAG1e0cf60fc [2022-12-14 23:32:56,693 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/data/65ad3fdb9/e89a6e426c22413ead8efecdaed06e49 [2022-12-14 23:32:56,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 23:32:56,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 23:32:56,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 23:32:56,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 23:32:56,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 23:32:56,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:32:56" (1/1) ... [2022-12-14 23:32:56,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c09aaea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:56, skipping insertion in model container [2022-12-14 23:32:56,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:32:56" (1/1) ... [2022-12-14 23:32:56,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 23:32:56,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 23:32:56,954 WARN L237 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_23e8a834-45e5-4bd5-8552-9497b266b56d/sv-benchmarks/c/eca-rers2012/Problem02_label50.c[14631,14644] [2022-12-14 23:32:56,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:32:56,993 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 23:32:57,037 WARN L237 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_23e8a834-45e5-4bd5-8552-9497b266b56d/sv-benchmarks/c/eca-rers2012/Problem02_label50.c[14631,14644] [2022-12-14 23:32:57,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:32:57,063 INFO L208 MainTranslator]: Completed translation [2022-12-14 23:32:57,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57 WrapperNode [2022-12-14 23:32:57,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 23:32:57,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 23:32:57,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 23:32:57,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 23:32:57,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,124 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-12-14 23:32:57,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 23:32:57,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 23:32:57,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 23:32:57,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 23:32:57,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,167 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 23:32:57,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 23:32:57,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 23:32:57,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 23:32:57,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:32:57" (1/1) ... [2022-12-14 23:32:57,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:32:57,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 23:32:57,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 23:32:57,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 23:32:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 23:32:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 23:32:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 23:32:57,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 23:32:57,308 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 23:32:57,310 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 23:32:58,066 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 23:32:58,217 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 23:32:58,217 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 23:32:58,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:32:58 BoogieIcfgContainer [2022-12-14 23:32:58,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 23:32:58,219 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 23:32:58,220 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 23:32:58,226 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 23:32:58,227 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:32:58" (1/1) ... [2022-12-14 23:32:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 23:32:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:32:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2022-12-14 23:32:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2022-12-14 23:32:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 23:32:58,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:32:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:32:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:32:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:32:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:32:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 163 states and 295 transitions. [2022-12-14 23:32:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 295 transitions. [2022-12-14 23:32:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 23:32:58,952 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:32:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:32:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:32:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:32:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:32:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 166 states and 300 transitions. [2022-12-14 23:32:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 300 transitions. [2022-12-14 23:32:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-14 23:32:59,182 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:32:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:32:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:32:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:32:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:32:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 245 states and 382 transitions. [2022-12-14 23:32:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2022-12-14 23:32:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 23:32:59,882 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:32:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:32:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:32:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 250 states and 391 transitions. [2022-12-14 23:33:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 391 transitions. [2022-12-14 23:33:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 23:33:00,045 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 253 states and 395 transitions. [2022-12-14 23:33:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 395 transitions. [2022-12-14 23:33:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 23:33:00,189 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 257 states and 403 transitions. [2022-12-14 23:33:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2022-12-14 23:33:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 23:33:00,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 266 states and 416 transitions. [2022-12-14 23:33:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 416 transitions. [2022-12-14 23:33:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 23:33:00,737 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 269 states and 424 transitions. [2022-12-14 23:33:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 424 transitions. [2022-12-14 23:33:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 23:33:01,016 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 272 states and 430 transitions. [2022-12-14 23:33:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 430 transitions. [2022-12-14 23:33:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 23:33:01,234 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 274 states and 431 transitions. [2022-12-14 23:33:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 431 transitions. [2022-12-14 23:33:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 23:33:01,360 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 278 states and 438 transitions. [2022-12-14 23:33:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 438 transitions. [2022-12-14 23:33:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 23:33:01,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 281 states and 441 transitions. [2022-12-14 23:33:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 441 transitions. [2022-12-14 23:33:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 23:33:01,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:01,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:33:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 288 states and 453 transitions. [2022-12-14 23:33:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 453 transitions. [2022-12-14 23:33:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 23:33:02,168 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:02,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:33:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 290 states and 454 transitions. [2022-12-14 23:33:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 454 transitions. [2022-12-14 23:33:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 23:33:02,314 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 291 states and 455 transitions. [2022-12-14 23:33:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 455 transitions. [2022-12-14 23:33:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 23:33:02,440 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 293 states and 457 transitions. [2022-12-14 23:33:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 457 transitions. [2022-12-14 23:33:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 23:33:02,493 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:33:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 306 states and 474 transitions. [2022-12-14 23:33:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 474 transitions. [2022-12-14 23:33:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 23:33:02,655 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 313 states and 481 transitions. [2022-12-14 23:33:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 481 transitions. [2022-12-14 23:33:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 23:33:02,726 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 23:33:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 314 states and 482 transitions. [2022-12-14 23:33:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 482 transitions. [2022-12-14 23:33:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 23:33:02,865 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:02,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 331 states and 502 transitions. [2022-12-14 23:33:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 502 transitions. [2022-12-14 23:33:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 23:33:03,038 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:03,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 355 states and 532 transitions. [2022-12-14 23:33:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 532 transitions. [2022-12-14 23:33:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-14 23:33:03,504 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 357 states and 535 transitions. [2022-12-14 23:33:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 535 transitions. [2022-12-14 23:33:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 23:33:03,651 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 363 states and 543 transitions. [2022-12-14 23:33:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 543 transitions. [2022-12-14 23:33:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 23:33:03,770 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 387 states and 575 transitions. [2022-12-14 23:33:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2022-12-14 23:33:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 23:33:04,761 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 410 states and 601 transitions. [2022-12-14 23:33:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2022-12-14 23:33:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 23:33:05,124 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 412 states and 602 transitions. [2022-12-14 23:33:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 602 transitions. [2022-12-14 23:33:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 23:33:05,337 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:33:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 436 states and 633 transitions. [2022-12-14 23:33:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 633 transitions. [2022-12-14 23:33:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 23:33:06,310 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:06,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:33:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 438 states and 634 transitions. [2022-12-14 23:33:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 634 transitions. [2022-12-14 23:33:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 23:33:06,534 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 517 states and 732 transitions. [2022-12-14 23:33:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 732 transitions. [2022-12-14 23:33:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 23:33:07,160 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 549 states and 771 transitions. [2022-12-14 23:33:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 771 transitions. [2022-12-14 23:33:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 23:33:08,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 558 states and 782 transitions. [2022-12-14 23:33:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 782 transitions. [2022-12-14 23:33:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 23:33:08,387 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 559 states and 783 transitions. [2022-12-14 23:33:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 783 transitions. [2022-12-14 23:33:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:33:08,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:08,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 587 states and 815 transitions. [2022-12-14 23:33:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 815 transitions. [2022-12-14 23:33:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:33:09,293 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 589 states and 816 transitions. [2022-12-14 23:33:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 816 transitions. [2022-12-14 23:33:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:33:09,466 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 598 states and 834 transitions. [2022-12-14 23:33:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 834 transitions. [2022-12-14 23:33:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:33:09,986 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 601 states and 841 transitions. [2022-12-14 23:33:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 841 transitions. [2022-12-14 23:33:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:33:10,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 610 states and 851 transitions. [2022-12-14 23:33:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 851 transitions. [2022-12-14 23:33:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:33:10,347 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 612 states and 853 transitions. [2022-12-14 23:33:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 853 transitions. [2022-12-14 23:33:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:33:10,513 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 614 states and 854 transitions. [2022-12-14 23:33:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 854 transitions. [2022-12-14 23:33:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 23:33:10,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 615 states and 855 transitions. [2022-12-14 23:33:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 855 transitions. [2022-12-14 23:33:10,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 23:33:10,738 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 23:33:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 618 states and 858 transitions. [2022-12-14 23:33:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 858 transitions. [2022-12-14 23:33:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 23:33:10,801 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 23:33:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 620 states and 860 transitions. [2022-12-14 23:33:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 860 transitions. [2022-12-14 23:33:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 23:33:10,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 636 states and 878 transitions. [2022-12-14 23:33:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 878 transitions. [2022-12-14 23:33:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 23:33:10,979 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 637 states and 879 transitions. [2022-12-14 23:33:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 879 transitions. [2022-12-14 23:33:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 23:33:11,041 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 716 states and 962 transitions. [2022-12-14 23:33:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 962 transitions. [2022-12-14 23:33:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 23:33:11,764 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 729 states and 976 transitions. [2022-12-14 23:33:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-12-14 23:33:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-14 23:33:11,871 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 23:33:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 753 states and 1010 transitions. [2022-12-14 23:33:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1010 transitions. [2022-12-14 23:33:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-14 23:33:12,622 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 23:33:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 766 states and 1025 transitions. [2022-12-14 23:33:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1025 transitions. [2022-12-14 23:33:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-14 23:33:12,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 23:33:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 790 states and 1052 transitions. [2022-12-14 23:33:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1052 transitions. [2022-12-14 23:33:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 23:33:13,375 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:13,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 792 states and 1054 transitions. [2022-12-14 23:33:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1054 transitions. [2022-12-14 23:33:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 23:33:13,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 795 states and 1057 transitions. [2022-12-14 23:33:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1057 transitions. [2022-12-14 23:33:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 23:33:13,901 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:13,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 845 states and 1123 transitions. [2022-12-14 23:33:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1123 transitions. [2022-12-14 23:33:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 23:33:16,766 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:16,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 859 states and 1135 transitions. [2022-12-14 23:33:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1135 transitions. [2022-12-14 23:33:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 23:33:17,539 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 868 states and 1148 transitions. [2022-12-14 23:33:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1148 transitions. [2022-12-14 23:33:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 23:33:18,461 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 870 states and 1149 transitions. [2022-12-14 23:33:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1149 transitions. [2022-12-14 23:33:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 23:33:18,755 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 23:33:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 877 states and 1156 transitions. [2022-12-14 23:33:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1156 transitions. [2022-12-14 23:33:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 23:33:18,836 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 23:33:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 889 states and 1176 transitions. [2022-12-14 23:33:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1176 transitions. [2022-12-14 23:33:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 23:33:19,591 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 23:33:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 892 states and 1183 transitions. [2022-12-14 23:33:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1183 transitions. [2022-12-14 23:33:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 23:33:19,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 23:33:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 894 states and 1184 transitions. [2022-12-14 23:33:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1184 transitions. [2022-12-14 23:33:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 23:33:19,987 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 23:33:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 896 states and 1185 transitions. [2022-12-14 23:33:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1185 transitions. [2022-12-14 23:33:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 23:33:20,308 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:20,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 23:33:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 898 states and 1188 transitions. [2022-12-14 23:33:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1188 transitions. [2022-12-14 23:33:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 23:33:20,658 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 23:33:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 912 states and 1202 transitions. [2022-12-14 23:33:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1202 transitions. [2022-12-14 23:33:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 23:33:21,326 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 23:33:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 916 states and 1206 transitions. [2022-12-14 23:33:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1206 transitions. [2022-12-14 23:33:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-14 23:33:21,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 925 states and 1216 transitions. [2022-12-14 23:33:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1216 transitions. [2022-12-14 23:33:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-14 23:33:22,343 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:33:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 971 states and 1271 transitions. [2022-12-14 23:33:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1271 transitions. [2022-12-14 23:33:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 23:33:22,676 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:33:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 986 states and 1286 transitions. [2022-12-14 23:33:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1286 transitions. [2022-12-14 23:33:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 23:33:23,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1009 states and 1312 transitions. [2022-12-14 23:33:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1312 transitions. [2022-12-14 23:33:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 23:33:24,594 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1012 states and 1315 transitions. [2022-12-14 23:33:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1315 transitions. [2022-12-14 23:33:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-12-14 23:33:24,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:33:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1056 states and 1366 transitions. [2022-12-14 23:33:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1366 transitions. [2022-12-14 23:33:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 23:33:26,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-14 23:33:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1098 states and 1414 transitions. [2022-12-14 23:33:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1414 transitions. [2022-12-14 23:33:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 23:33:27,308 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1107 states and 1428 transitions. [2022-12-14 23:33:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1428 transitions. [2022-12-14 23:33:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-14 23:33:27,432 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:27,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1139 states and 1465 transitions. [2022-12-14 23:33:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1465 transitions. [2022-12-14 23:33:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 23:33:28,086 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1162 states and 1489 transitions. [2022-12-14 23:33:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1489 transitions. [2022-12-14 23:33:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-14 23:33:28,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1189 states and 1518 transitions. [2022-12-14 23:33:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1518 transitions. [2022-12-14 23:33:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 23:33:28,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1198 states and 1529 transitions. [2022-12-14 23:33:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1529 transitions. [2022-12-14 23:33:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 23:33:28,509 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:28,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1203 states and 1536 transitions. [2022-12-14 23:33:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1536 transitions. [2022-12-14 23:33:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 23:33:29,191 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:29,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1218 states and 1552 transitions. [2022-12-14 23:33:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1552 transitions. [2022-12-14 23:33:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 23:33:29,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 23:33:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1225 states and 1559 transitions. [2022-12-14 23:33:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1559 transitions. [2022-12-14 23:33:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 23:33:30,093 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1262 states and 1602 transitions. [2022-12-14 23:33:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1602 transitions. [2022-12-14 23:33:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 23:33:30,853 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:30,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1273 states and 1613 transitions. [2022-12-14 23:33:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1613 transitions. [2022-12-14 23:33:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 23:33:31,000 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:33:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1298 states and 1641 transitions. [2022-12-14 23:33:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1641 transitions. [2022-12-14 23:33:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 23:33:31,227 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:33:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1309 states and 1652 transitions. [2022-12-14 23:33:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1652 transitions. [2022-12-14 23:33:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 23:33:31,338 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1331 states and 1675 transitions. [2022-12-14 23:33:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1675 transitions. [2022-12-14 23:33:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 23:33:32,135 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 23:33:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1333 states and 1697 transitions. [2022-12-14 23:33:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1697 transitions. [2022-12-14 23:33:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 23:33:32,476 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 23:33:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1353 states and 1720 transitions. [2022-12-14 23:33:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1720 transitions. [2022-12-14 23:33:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 23:33:32,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 23:33:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1359 states and 1726 transitions. [2022-12-14 23:33:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1726 transitions. [2022-12-14 23:33:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-14 23:33:33,309 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:33,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 23:33:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1369 states and 1735 transitions. [2022-12-14 23:33:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1735 transitions. [2022-12-14 23:33:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-14 23:33:33,637 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 23:33:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1376 states and 1746 transitions. [2022-12-14 23:33:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1746 transitions. [2022-12-14 23:33:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-14 23:33:33,925 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 23:33:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1382 states and 1755 transitions. [2022-12-14 23:33:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1755 transitions. [2022-12-14 23:33:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-14 23:33:34,355 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-14 23:33:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1386 states and 1759 transitions. [2022-12-14 23:33:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1759 transitions. [2022-12-14 23:33:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-14 23:33:34,761 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-14 23:33:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1389 states and 1765 transitions. [2022-12-14 23:33:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1765 transitions. [2022-12-14 23:33:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-14 23:33:35,169 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-14 23:33:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1414 states and 1792 transitions. [2022-12-14 23:33:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1792 transitions. [2022-12-14 23:33:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 23:33:35,669 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1483 states and 1871 transitions. [2022-12-14 23:33:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1871 transitions. [2022-12-14 23:33:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 23:33:36,881 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:36,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-14 23:33:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1484 states and 1871 transitions. [2022-12-14 23:33:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1871 transitions. [2022-12-14 23:33:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 23:33:37,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 23:33:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1491 states and 1879 transitions. [2022-12-14 23:33:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1879 transitions. [2022-12-14 23:33:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-14 23:33:37,407 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:33:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1537 states and 1927 transitions. [2022-12-14 23:33:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1927 transitions. [2022-12-14 23:33:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 23:33:39,018 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1543 states and 1934 transitions. [2022-12-14 23:33:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1934 transitions. [2022-12-14 23:33:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 23:33:39,128 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1544 states and 1934 transitions. [2022-12-14 23:33:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1934 transitions. [2022-12-14 23:33:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 23:33:39,506 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 23:33:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1548 states and 1938 transitions. [2022-12-14 23:33:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1938 transitions. [2022-12-14 23:33:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 23:33:39,778 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:33:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1574 states and 1968 transitions. [2022-12-14 23:33:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1968 transitions. [2022-12-14 23:33:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 23:33:40,120 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:33:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1606 states and 2004 transitions. [2022-12-14 23:33:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2004 transitions. [2022-12-14 23:33:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 23:33:40,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:33:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 1617 states and 2015 transitions. [2022-12-14 23:33:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2015 transitions. [2022-12-14 23:33:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 23:33:41,050 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:33:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 1629 states and 2027 transitions. [2022-12-14 23:33:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2027 transitions. [2022-12-14 23:33:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 23:33:41,561 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 23:33:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1633 states and 2030 transitions. [2022-12-14 23:33:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2030 transitions. [2022-12-14 23:33:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 23:33:42,106 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:42,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 23:33:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1641 states and 2037 transitions. [2022-12-14 23:33:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2037 transitions. [2022-12-14 23:33:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 23:33:42,236 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 23:33:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 1673 states and 2073 transitions. [2022-12-14 23:33:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2073 transitions. [2022-12-14 23:33:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 23:33:42,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:42,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 23:33:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1679 states and 2080 transitions. [2022-12-14 23:33:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2080 transitions. [2022-12-14 23:33:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 23:33:43,234 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 23:33:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1681 states and 2081 transitions. [2022-12-14 23:33:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2081 transitions. [2022-12-14 23:33:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 23:33:43,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1685 states and 2084 transitions. [2022-12-14 23:33:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2084 transitions. [2022-12-14 23:33:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 23:33:43,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 23:33:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1692 states and 2094 transitions. [2022-12-14 23:33:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2094 transitions. [2022-12-14 23:33:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 23:33:44,610 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 23:33:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1736 states and 2144 transitions. [2022-12-14 23:33:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2144 transitions. [2022-12-14 23:33:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 23:33:46,003 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 23:33:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1750 states and 2158 transitions. [2022-12-14 23:33:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2158 transitions. [2022-12-14 23:33:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-12-14 23:33:46,888 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:46,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:33:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 1752 states and 2160 transitions. [2022-12-14 23:33:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2160 transitions. [2022-12-14 23:33:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-12-14 23:33:47,029 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 117 proven. 37 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 23:33:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1782 states and 2191 transitions. [2022-12-14 23:33:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2191 transitions. [2022-12-14 23:33:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 23:33:48,398 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:33:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 1787 states and 2196 transitions. [2022-12-14 23:33:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2196 transitions. [2022-12-14 23:33:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-14 23:33:48,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:33:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1846 states and 2256 transitions. [2022-12-14 23:33:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2256 transitions. [2022-12-14 23:33:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-14 23:33:49,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 23:33:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1853 states and 2265 transitions. [2022-12-14 23:33:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2265 transitions. [2022-12-14 23:33:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-14 23:33:49,316 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 152 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:33:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1871 states and 2287 transitions. [2022-12-14 23:33:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2287 transitions. [2022-12-14 23:33:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 23:33:50,103 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:33:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1896 states and 2316 transitions. [2022-12-14 23:33:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2316 transitions. [2022-12-14 23:33:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 23:33:50,434 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:33:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 1907 states and 2329 transitions. [2022-12-14 23:33:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2329 transitions. [2022-12-14 23:33:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 23:33:50,627 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:33:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 1920 states and 2343 transitions. [2022-12-14 23:33:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2343 transitions. [2022-12-14 23:33:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 23:33:51,141 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:33:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 1924 states and 2346 transitions. [2022-12-14 23:33:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2346 transitions. [2022-12-14 23:33:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 23:33:51,372 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:33:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 1934 states and 2360 transitions. [2022-12-14 23:33:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2360 transitions. [2022-12-14 23:33:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 23:33:51,875 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:33:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 1941 states and 2369 transitions. [2022-12-14 23:33:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2369 transitions. [2022-12-14 23:33:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 23:33:52,592 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:33:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 1943 states and 2370 transitions. [2022-12-14 23:33:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2370 transitions. [2022-12-14 23:33:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 23:33:52,957 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:52,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:33:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 1974 states and 2406 transitions. [2022-12-14 23:33:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2406 transitions. [2022-12-14 23:33:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 23:33:53,569 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:33:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 1991 states and 2422 transitions. [2022-12-14 23:33:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2422 transitions. [2022-12-14 23:33:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 23:33:53,872 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 23:33:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2009 states and 2440 transitions. [2022-12-14 23:33:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2440 transitions. [2022-12-14 23:33:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 23:33:54,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-14 23:33:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2010 states and 2440 transitions. [2022-12-14 23:33:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2440 transitions. [2022-12-14 23:33:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 23:33:54,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:33:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2023 states and 2458 transitions. [2022-12-14 23:33:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2458 transitions. [2022-12-14 23:33:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 23:33:55,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:55,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:33:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2035 states and 2473 transitions. [2022-12-14 23:33:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2473 transitions. [2022-12-14 23:33:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 23:33:56,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 23:33:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2041 states and 2483 transitions. [2022-12-14 23:33:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2483 transitions. [2022-12-14 23:33:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 23:33:56,860 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 23:33:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2075 states and 2520 transitions. [2022-12-14 23:33:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2520 transitions. [2022-12-14 23:33:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 23:33:57,339 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 123 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:33:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2100 states and 2548 transitions. [2022-12-14 23:33:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2548 transitions. [2022-12-14 23:33:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 23:33:58,451 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 123 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:33:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2102 states and 2549 transitions. [2022-12-14 23:33:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2549 transitions. [2022-12-14 23:33:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-12-14 23:33:59,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:59,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 23:33:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:33:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2117 states and 2564 transitions. [2022-12-14 23:33:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2564 transitions. [2022-12-14 23:33:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-12-14 23:33:59,666 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:33:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:33:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:33:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:34:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2122 states and 2569 transitions. [2022-12-14 23:34:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2569 transitions. [2022-12-14 23:34:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-12-14 23:34:00,192 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:34:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2127 states and 2575 transitions. [2022-12-14 23:34:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2575 transitions. [2022-12-14 23:34:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 23:34:00,896 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 23:34:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2189 states and 2647 transitions. [2022-12-14 23:34:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2647 transitions. [2022-12-14 23:34:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 23:34:02,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:02,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 23:34:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2236 states and 2699 transitions. [2022-12-14 23:34:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2699 transitions. [2022-12-14 23:34:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 23:34:03,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 23:34:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2239 states and 2701 transitions. [2022-12-14 23:34:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 2701 transitions. [2022-12-14 23:34:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 23:34:04,222 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 23:34:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2245 states and 2706 transitions. [2022-12-14 23:34:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2706 transitions. [2022-12-14 23:34:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 23:34:04,643 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 23:34:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2288 states and 2751 transitions. [2022-12-14 23:34:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2751 transitions. [2022-12-14 23:34:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 23:34:05,063 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:05,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 23:34:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2331 states and 2800 transitions. [2022-12-14 23:34:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2800 transitions. [2022-12-14 23:34:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 23:34:05,542 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 23:34:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2342 states and 2811 transitions. [2022-12-14 23:34:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 2811 transitions. [2022-12-14 23:34:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 23:34:05,709 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:34:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2365 states and 2834 transitions. [2022-12-14 23:34:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2834 transitions. [2022-12-14 23:34:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 23:34:07,014 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:07,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:34:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2379 states and 2848 transitions. [2022-12-14 23:34:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 2848 transitions. [2022-12-14 23:34:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-12-14 23:34:07,525 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 160 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:34:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2406 states and 2882 transitions. [2022-12-14 23:34:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2882 transitions. [2022-12-14 23:34:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 23:34:09,592 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:34:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2486 states and 2964 transitions. [2022-12-14 23:34:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2964 transitions. [2022-12-14 23:34:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 23:34:12,838 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:34:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2489 states and 2966 transitions. [2022-12-14 23:34:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 2966 transitions. [2022-12-14 23:34:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-14 23:34:13,583 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 23:34:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2495 states and 2971 transitions. [2022-12-14 23:34:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2971 transitions. [2022-12-14 23:34:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-14 23:34:13,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 23:34:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2497 states and 2973 transitions. [2022-12-14 23:34:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 2973 transitions. [2022-12-14 23:34:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-14 23:34:13,854 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:34:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 23:34:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:34:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2514 states and 2989 transitions. [2022-12-14 23:34:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2989 transitions. [2022-12-14 23:34:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-12-14 23:34:14,016 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:34:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:34:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:34:14,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:34:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:34:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:34:14,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:34:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:34:14,237 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 154 iterations. [2022-12-14 23:34:14,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 11:34:14 ImpRootNode [2022-12-14 23:34:14,364 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 23:34:14,364 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 23:34:14,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 23:34:14,365 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 23:34:14,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:32:58" (3/4) ... [2022-12-14 23:34:14,366 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 23:34:14,479 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 23:34:14,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 23:34:14,480 INFO L158 Benchmark]: Toolchain (without parser) took 77783.82ms. Allocated memory was 136.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 96.2MB in the beginning and 664.8MB in the end (delta: -568.6MB). Peak memory consumption was 639.3MB. Max. memory is 16.1GB. [2022-12-14 23:34:14,480 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 23:34:14,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.56ms. Allocated memory is still 136.3MB. Free memory was 96.2MB in the beginning and 69.8MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 23:34:14,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.97ms. Allocated memory is still 136.3MB. Free memory was 69.8MB in the beginning and 64.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 23:34:14,481 INFO L158 Benchmark]: Boogie Preprocessor took 50.34ms. Allocated memory is still 136.3MB. Free memory was 64.3MB in the beginning and 60.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 23:34:14,481 INFO L158 Benchmark]: RCFGBuilder took 1042.43ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 60.1MB in the beginning and 93.0MB in the end (delta: -32.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-12-14 23:34:14,482 INFO L158 Benchmark]: CodeCheck took 76144.64ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 93.0MB in the beginning and 683.7MB in the end (delta: -590.7MB). Peak memory consumption was 575.3MB. Max. memory is 16.1GB. [2022-12-14 23:34:14,482 INFO L158 Benchmark]: Witness Printer took 115.05ms. Allocated memory is still 1.3GB. Free memory was 683.7MB in the beginning and 664.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 23:34:14,483 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: 76.0s, OverallIterations: 154, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411693 SdHoareTripleChecker+Valid, 690.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382049 mSDsluCounter, 73531 SdHoareTripleChecker+Invalid, 591.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63896 mSDsCounter, 133585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868446 IncrementalHoareTripleChecker+Invalid, 1002031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133585 mSolverCounterUnsat, 9635 mSDtfsCounter, 868446 mSolverCounterSat, 5.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167832 GetRequests, 165496 SyntacticMatches, 1420 SemanticMatches, 916 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512039 ImplicationChecksByTransitivity, 51.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 23253 NumberOfCodeBlocks, 23253 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 22890 ConstructedInterpolants, 0 QuantifiedInterpolants, 52745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 153 InterpolantComputations, 132 PerfectInterpolantSequences, 14886/15202 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.17ms. Allocated memory is still 136.3MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.56ms. Allocated memory is still 136.3MB. Free memory was 96.2MB in the beginning and 69.8MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.97ms. Allocated memory is still 136.3MB. Free memory was 69.8MB in the beginning and 64.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.34ms. Allocated memory is still 136.3MB. Free memory was 64.3MB in the beginning and 60.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1042.43ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 60.1MB in the beginning and 93.0MB in the end (delta: -32.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * CodeCheck took 76144.64ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 93.0MB in the beginning and 683.7MB in the end (delta: -590.7MB). Peak memory consumption was 575.3MB. Max. memory is 16.1GB. * Witness Printer took 115.05ms. Allocated memory is still 1.3GB. Free memory was 683.7MB in the beginning and 664.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 23:34:14,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23e8a834-45e5-4bd5-8552-9497b266b56d/bin/ukojak-rkRKPMF4O4/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