./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.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_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/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_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/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_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/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 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 --- 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:56:26,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 23:56:26,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 23:56:26,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 23:56:26,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 23:56:26,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 23:56:26,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 23:56:26,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 23:56:26,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 23:56:26,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 23:56:26,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 23:56:26,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 23:56:26,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 23:56:26,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 23:56:26,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 23:56:26,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 23:56:26,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 23:56:26,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 23:56:26,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 23:56:26,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 23:56:26,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 23:56:26,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 23:56:26,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 23:56:26,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 23:56:26,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 23:56:26,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 23:56:26,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 23:56:26,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 23:56:26,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 23:56:26,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 23:56:26,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 23:56:26,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 23:56:26,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 23:56:26,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 23:56:26,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 23:56:26,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 23:56:26,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 23:56:26,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 23:56:26,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 23:56:26,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 23:56:26,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 23:56:26,694 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 23:56:26,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 23:56:26,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 23:56:26,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 23:56:26,714 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 23:56:26,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 23:56:26,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 23:56:26,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 23:56:26,715 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 23:56:26,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 23:56:26,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 23:56:26,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 23:56:26,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 23:56:26,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 23:56:26,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 23:56:26,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 23:56:26,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 23:56:26,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 23:56:26,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 23:56:26,717 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 23:56:26,717 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 23:56:26,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 23:56:26,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:56:26,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 23:56:26,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 23:56:26,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 23:56:26,718 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 23:56:26,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 23:56:26,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 23:56:26,719 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_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/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_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/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 -> 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 [2022-12-14 23:56:26,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 23:56:26,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 23:56:26,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 23:56:26,903 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 23:56:26,903 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 23:56:26,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2022-12-14 23:56:29,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 23:56:29,707 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 23:56:29,707 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2022-12-14 23:56:29,716 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/data/09b690144/d5e09ac437b74eb3a850e00b4a4a839d/FLAGfb34b21d7 [2022-12-14 23:56:29,727 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/data/09b690144/d5e09ac437b74eb3a850e00b4a4a839d [2022-12-14 23:56:29,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 23:56:29,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 23:56:29,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 23:56:29,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 23:56:29,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 23:56:29,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:56:29" (1/1) ... [2022-12-14 23:56:29,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2f0b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:29, skipping insertion in model container [2022-12-14 23:56:29,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:56:29" (1/1) ... [2022-12-14 23:56:29,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 23:56:29,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 23:56:29,968 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_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2022-12-14 23:56:30,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:56:30,008 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 23:56:30,060 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_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2022-12-14 23:56:30,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:56:30,085 INFO L208 MainTranslator]: Completed translation [2022-12-14 23:56:30,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30 WrapperNode [2022-12-14 23:56:30,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 23:56:30,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 23:56:30,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 23:56:30,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 23:56:30,091 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:56:30" (1/1) ... [2022-12-14 23:56:30,103 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:56:30" (1/1) ... [2022-12-14 23:56:30,131 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 23:56:30,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 23:56:30,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 23:56:30,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 23:56:30,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 23:56:30,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,161 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 23:56:30,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 23:56:30,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 23:56:30,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 23:56:30,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:56:30" (1/1) ... [2022-12-14 23:56:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:56:30,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 23:56:30,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 23:56:30,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 23:56:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 23:56:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 23:56:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 23:56:30,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 23:56:30,294 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 23:56:30,296 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 23:56:31,020 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 23:56:31,166 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 23:56:31,166 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 23:56:31,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:56:31 BoogieIcfgContainer [2022-12-14 23:56:31,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 23:56:31,169 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 23:56:31,169 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 23:56:31,176 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 23:56:31,176 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:56:31" (1/1) ... [2022-12-14 23:56:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 23:56:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 23:56:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 23:56:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 23:56:31,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:31,460 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:56:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2022-12-14 23:56:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2022-12-14 23:56:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 23:56:31,823 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2022-12-14 23:56:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2022-12-14 23:56:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 23:56:32,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:32,097 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:56:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2022-12-14 23:56:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2022-12-14 23:56:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 23:56:32,152 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2022-12-14 23:56:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2022-12-14 23:56:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 23:56:32,321 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2022-12-14 23:56:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2022-12-14 23:56:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 23:56:32,518 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:32,605 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:56:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2022-12-14 23:56:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2022-12-14 23:56:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 23:56:32,701 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:32,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:32,770 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:56:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2022-12-14 23:56:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2022-12-14 23:56:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 23:56:32,873 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:32,971 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:56:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2022-12-14 23:56:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2022-12-14 23:56:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 23:56:33,159 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:33,256 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:56:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2022-12-14 23:56:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2022-12-14 23:56:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 23:56:33,538 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:33,667 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:56:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2022-12-14 23:56:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2022-12-14 23:56:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 23:56:34,053 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2022-12-14 23:56:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2022-12-14 23:56:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 23:56:34,607 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:34,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2022-12-14 23:56:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2022-12-14 23:56:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 23:56:34,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:34,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2022-12-14 23:56:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2022-12-14 23:56:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 23:56:34,968 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2022-12-14 23:56:35,174 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2022-12-14 23:56:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 23:56:35,176 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:35,234 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:56:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2022-12-14 23:56:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2022-12-14 23:56:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 23:56:35,799 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:35,849 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:56:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2022-12-14 23:56:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2022-12-14 23:56:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 23:56:35,968 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2022-12-14 23:56:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2022-12-14 23:56:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 23:56:36,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:36,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2022-12-14 23:56:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2022-12-14 23:56:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 23:56:36,859 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:36,907 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:56:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2022-12-14 23:56:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2022-12-14 23:56:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 23:56:36,934 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2022-12-14 23:56:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2022-12-14 23:56:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 23:56:37,207 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2022-12-14 23:56:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2022-12-14 23:56:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 23:56:37,559 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2022-12-14 23:56:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2022-12-14 23:56:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 23:56:37,880 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:37,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2022-12-14 23:56:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2022-12-14 23:56:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 23:56:38,072 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:38,103 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:56:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2022-12-14 23:56:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2022-12-14 23:56:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 23:56:38,409 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2022-12-14 23:56:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2022-12-14 23:56:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 23:56:38,734 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:38,820 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:56:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2022-12-14 23:56:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2022-12-14 23:56:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 23:56:38,996 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2022-12-14 23:56:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2022-12-14 23:56:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 23:56:39,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2022-12-14 23:56:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2022-12-14 23:56:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 23:56:39,324 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:39,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2022-12-14 23:56:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2022-12-14 23:56:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 23:56:39,420 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:39,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:39,489 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:56:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2022-12-14 23:56:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2022-12-14 23:56:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 23:56:39,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:39,849 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:56:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2022-12-14 23:56:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2022-12-14 23:56:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 23:56:40,003 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2022-12-14 23:56:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2022-12-14 23:56:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 23:56:40,149 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2022-12-14 23:56:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2022-12-14 23:56:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 23:56:40,529 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2022-12-14 23:56:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2022-12-14 23:56:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 23:56:40,825 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:40,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2022-12-14 23:56:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2022-12-14 23:56:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 23:56:41,027 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:41,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2022-12-14 23:56:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2022-12-14 23:56:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 23:56:41,241 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:56:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 484 states and 656 transitions. [2022-12-14 23:56:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 656 transitions. [2022-12-14 23:56:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 23:56:41,682 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:41,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 486 states and 658 transitions. [2022-12-14 23:56:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 658 transitions. [2022-12-14 23:56:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 23:56:41,764 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 497 states and 672 transitions. [2022-12-14 23:56:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 672 transitions. [2022-12-14 23:56:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 23:56:41,925 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 504 states and 680 transitions. [2022-12-14 23:56:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 680 transitions. [2022-12-14 23:56:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 23:56:42,040 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 506 states and 682 transitions. [2022-12-14 23:56:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 682 transitions. [2022-12-14 23:56:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 23:56:42,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 513 states and 689 transitions. [2022-12-14 23:56:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 689 transitions. [2022-12-14 23:56:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 23:56:42,252 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:42,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 551 states and 733 transitions. [2022-12-14 23:56:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2022-12-14 23:56:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 23:56:42,864 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:42,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 554 states and 735 transitions. [2022-12-14 23:56:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 735 transitions. [2022-12-14 23:56:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 23:56:43,028 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 557 states and 737 transitions. [2022-12-14 23:56:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 737 transitions. [2022-12-14 23:56:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 23:56:43,237 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 23:56:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 566 states and 745 transitions. [2022-12-14 23:56:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 745 transitions. [2022-12-14 23:56:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 23:56:43,318 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 574 states and 753 transitions. [2022-12-14 23:56:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 753 transitions. [2022-12-14 23:56:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 23:56:43,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 605 states and 788 transitions. [2022-12-14 23:56:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 788 transitions. [2022-12-14 23:56:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 23:56:44,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 23:56:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 636 states and 825 transitions. [2022-12-14 23:56:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 825 transitions. [2022-12-14 23:56:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 23:56:44,630 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:44,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:56:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 645 states and 835 transitions. [2022-12-14 23:56:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 835 transitions. [2022-12-14 23:56:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 23:56:44,711 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:56:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 695 states and 893 transitions. [2022-12-14 23:56:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 893 transitions. [2022-12-14 23:56:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 23:56:45,641 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:45,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 23:56:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 698 states and 896 transitions. [2022-12-14 23:56:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2022-12-14 23:56:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 23:56:45,925 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 725 states and 926 transitions. [2022-12-14 23:56:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 926 transitions. [2022-12-14 23:56:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 23:56:46,075 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 23:56:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 744 states and 949 transitions. [2022-12-14 23:56:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 949 transitions. [2022-12-14 23:56:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 23:56:46,866 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:46,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 761 states and 966 transitions. [2022-12-14 23:56:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 966 transitions. [2022-12-14 23:56:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 23:56:47,059 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:47,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 784 states and 990 transitions. [2022-12-14 23:56:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 990 transitions. [2022-12-14 23:56:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-14 23:56:47,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:47,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 798 states and 1002 transitions. [2022-12-14 23:56:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1002 transitions. [2022-12-14 23:56:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-14 23:56:47,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 23:56:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 812 states and 1014 transitions. [2022-12-14 23:56:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1014 transitions. [2022-12-14 23:56:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 23:56:47,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 23:56:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 813 states and 1014 transitions. [2022-12-14 23:56:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1014 transitions. [2022-12-14 23:56:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 23:56:47,918 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 835 states and 1039 transitions. [2022-12-14 23:56:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1039 transitions. [2022-12-14 23:56:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 23:56:48,515 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 862 states and 1070 transitions. [2022-12-14 23:56:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1070 transitions. [2022-12-14 23:56:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 23:56:48,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:49,061 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:56:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 925 states and 1136 transitions. [2022-12-14 23:56:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1136 transitions. [2022-12-14 23:56:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 23:56:50,127 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 953 states and 1163 transitions. [2022-12-14 23:56:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1163 transitions. [2022-12-14 23:56:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-14 23:56:50,805 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:56:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1036 states and 1262 transitions. [2022-12-14 23:56:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1262 transitions. [2022-12-14 23:56:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 23:56:52,979 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:56:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1085 states and 1313 transitions. [2022-12-14 23:56:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1313 transitions. [2022-12-14 23:56:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 23:56:53,431 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:56:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1100 states and 1334 transitions. [2022-12-14 23:56:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1334 transitions. [2022-12-14 23:56:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 23:56:54,176 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:54,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:56:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1105 states and 1340 transitions. [2022-12-14 23:56:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1340 transitions. [2022-12-14 23:56:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 23:56:54,448 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:56:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1114 states and 1350 transitions. [2022-12-14 23:56:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1350 transitions. [2022-12-14 23:56:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-14 23:56:54,887 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:56:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1185 states and 1421 transitions. [2022-12-14 23:56:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1421 transitions. [2022-12-14 23:56:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-14 23:56:56,200 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:56:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1190 states and 1427 transitions. [2022-12-14 23:56:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1427 transitions. [2022-12-14 23:56:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 23:56:56,341 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:56,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 23:56:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1231 states and 1472 transitions. [2022-12-14 23:56:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1472 transitions. [2022-12-14 23:56:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-14 23:56:57,077 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 23:56:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1235 states and 1475 transitions. [2022-12-14 23:56:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1475 transitions. [2022-12-14 23:56:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 23:56:57,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:56:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1239 states and 1478 transitions. [2022-12-14 23:56:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1478 transitions. [2022-12-14 23:56:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-14 23:56:57,671 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 23:56:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1254 states and 1495 transitions. [2022-12-14 23:56:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1495 transitions. [2022-12-14 23:56:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-12-14 23:56:58,238 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:58,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 23:56:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:56:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1284 states and 1527 transitions. [2022-12-14 23:56:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1527 transitions. [2022-12-14 23:56:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 23:56:58,982 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:56:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:56:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:56:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1375 states and 1641 transitions. [2022-12-14 23:57:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1641 transitions. [2022-12-14 23:57:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 23:57:01,136 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1379 states and 1645 transitions. [2022-12-14 23:57:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1645 transitions. [2022-12-14 23:57:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 23:57:01,669 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1429 states and 1714 transitions. [2022-12-14 23:57:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1714 transitions. [2022-12-14 23:57:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 23:57:04,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1447 states and 1736 transitions. [2022-12-14 23:57:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1736 transitions. [2022-12-14 23:57:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 23:57:05,358 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 23:57:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1450 states and 1737 transitions. [2022-12-14 23:57:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1737 transitions. [2022-12-14 23:57:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 23:57:05,707 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:05,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-12-14 23:57:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1520 states and 1809 transitions. [2022-12-14 23:57:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1809 transitions. [2022-12-14 23:57:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 23:57:06,185 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:06,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1525 states and 1821 transitions. [2022-12-14 23:57:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1821 transitions. [2022-12-14 23:57:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 23:57:07,020 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1526 states and 1821 transitions. [2022-12-14 23:57:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1821 transitions. [2022-12-14 23:57:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 23:57:07,542 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:07,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1527 states and 1821 transitions. [2022-12-14 23:57:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1821 transitions. [2022-12-14 23:57:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 23:57:08,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 23:57:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1574 states and 1874 transitions. [2022-12-14 23:57:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1874 transitions. [2022-12-14 23:57:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 23:57:08,858 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:57:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1594 states and 1894 transitions. [2022-12-14 23:57:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1894 transitions. [2022-12-14 23:57:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-14 23:57:09,141 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1665 states and 1981 transitions. [2022-12-14 23:57:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1981 transitions. [2022-12-14 23:57:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-12-14 23:57:10,894 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:10,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 23:57:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1668 states and 1983 transitions. [2022-12-14 23:57:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1983 transitions. [2022-12-14 23:57:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-14 23:57:11,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-14 23:57:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1670 states and 1984 transitions. [2022-12-14 23:57:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1984 transitions. [2022-12-14 23:57:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-14 23:57:11,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 23:57:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1683 states and 1997 transitions. [2022-12-14 23:57:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1997 transitions. [2022-12-14 23:57:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-14 23:57:12,034 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 23:57:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1686 states and 1999 transitions. [2022-12-14 23:57:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 1999 transitions. [2022-12-14 23:57:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-14 23:57:12,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 23:57:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 1689 states and 2002 transitions. [2022-12-14 23:57:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2002 transitions. [2022-12-14 23:57:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 23:57:12,954 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 1725 states and 2041 transitions. [2022-12-14 23:57:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2041 transitions. [2022-12-14 23:57:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 23:57:14,481 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 1730 states and 2045 transitions. [2022-12-14 23:57:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2045 transitions. [2022-12-14 23:57:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 23:57:14,965 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:14,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1768 states and 2090 transitions. [2022-12-14 23:57:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2090 transitions. [2022-12-14 23:57:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-12-14 23:57:17,564 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 23:57:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 1773 states and 2097 transitions. [2022-12-14 23:57:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2097 transitions. [2022-12-14 23:57:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 23:57:17,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 23:57:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 1788 states and 2116 transitions. [2022-12-14 23:57:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2116 transitions. [2022-12-14 23:57:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 23:57:18,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-12-14 23:57:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 1858 states and 2188 transitions. [2022-12-14 23:57:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2188 transitions. [2022-12-14 23:57:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-14 23:57:19,207 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 1951 states and 2294 transitions. [2022-12-14 23:57:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2294 transitions. [2022-12-14 23:57:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 23:57:21,445 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 23:57:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2016 states and 2375 transitions. [2022-12-14 23:57:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2375 transitions. [2022-12-14 23:57:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 23:57:23,501 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 23:57:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2054 states and 2418 transitions. [2022-12-14 23:57:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2418 transitions. [2022-12-14 23:57:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-14 23:57:26,134 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:26,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-14 23:57:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2061 states and 2424 transitions. [2022-12-14 23:57:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2424 transitions. [2022-12-14 23:57:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 23:57:26,455 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2111 states and 2491 transitions. [2022-12-14 23:57:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2491 transitions. [2022-12-14 23:57:28,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 23:57:28,408 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2121 states and 2499 transitions. [2022-12-14 23:57:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2499 transitions. [2022-12-14 23:57:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 23:57:29,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2142 states and 2520 transitions. [2022-12-14 23:57:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2520 transitions. [2022-12-14 23:57:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 23:57:29,950 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:29,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:57:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2149 states and 2526 transitions. [2022-12-14 23:57:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2526 transitions. [2022-12-14 23:57:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-14 23:57:30,531 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 23:57:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2169 states and 2546 transitions. [2022-12-14 23:57:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2546 transitions. [2022-12-14 23:57:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-12-14 23:57:31,425 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 23:57:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2189 states and 2566 transitions. [2022-12-14 23:57:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2566 transitions. [2022-12-14 23:57:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:32,168 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-12-14 23:57:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2225 states and 2602 transitions. [2022-12-14 23:57:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2602 transitions. [2022-12-14 23:57:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:32,409 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2264 states and 2672 transitions. [2022-12-14 23:57:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2672 transitions. [2022-12-14 23:57:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:34,544 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2278 states and 2689 transitions. [2022-12-14 23:57:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2689 transitions. [2022-12-14 23:57:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:35,438 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:35,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2282 states and 2692 transitions. [2022-12-14 23:57:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2692 transitions. [2022-12-14 23:57:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:36,115 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:36,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2289 states and 2701 transitions. [2022-12-14 23:57:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 2701 transitions. [2022-12-14 23:57:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:36,895 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2305 states and 2724 transitions. [2022-12-14 23:57:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 2724 transitions. [2022-12-14 23:57:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:38,127 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:38,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2311 states and 2731 transitions. [2022-12-14 23:57:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2731 transitions. [2022-12-14 23:57:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:38,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2314 states and 2733 transitions. [2022-12-14 23:57:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2733 transitions. [2022-12-14 23:57:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:39,064 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:39,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2328 states and 2748 transitions. [2022-12-14 23:57:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2748 transitions. [2022-12-14 23:57:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:39,535 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2334 states and 2753 transitions. [2022-12-14 23:57:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 2753 transitions. [2022-12-14 23:57:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:40,173 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:40,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2337 states and 2755 transitions. [2022-12-14 23:57:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2755 transitions. [2022-12-14 23:57:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:40,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2340 states and 2757 transitions. [2022-12-14 23:57:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2757 transitions. [2022-12-14 23:57:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 23:57:41,043 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 23:57:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2343 states and 2759 transitions. [2022-12-14 23:57:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 2759 transitions. [2022-12-14 23:57:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-12-14 23:57:41,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-12-14 23:57:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2350 states and 2764 transitions. [2022-12-14 23:57:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2764 transitions. [2022-12-14 23:57:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-12-14 23:57:41,960 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-12-14 23:57:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2353 states and 2766 transitions. [2022-12-14 23:57:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 2766 transitions. [2022-12-14 23:57:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-12-14 23:57:42,214 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:42,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:57:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-12-14 23:57:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:57:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2362 states and 2774 transitions. [2022-12-14 23:57:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2774 transitions. [2022-12-14 23:57:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-12-14 23:57:42,401 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:57:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:57:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:57:42,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:57:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:57:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:57:42,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:57:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:57:42,754 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 125 iterations. [2022-12-14 23:57:42,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 11:57:42 ImpRootNode [2022-12-14 23:57:42,944 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 23:57:42,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 23:57:42,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 23:57:42,944 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 23:57:42,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:56:31" (3/4) ... [2022-12-14 23:57:42,946 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 23:57:43,081 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 23:57:43,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 23:57:43,081 INFO L158 Benchmark]: Toolchain (without parser) took 73351.06ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 118.6MB in the beginning and 524.1MB in the end (delta: -405.5MB). Peak memory consumption was 851.4MB. Max. memory is 16.1GB. [2022-12-14 23:57:43,082 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 115.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 23:57:43,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.75ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 90.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 23:57:43,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.28ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 85.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 23:57:43,082 INFO L158 Benchmark]: Boogie Preprocessor took 36.92ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 23:57:43,082 INFO L158 Benchmark]: RCFGBuilder took 999.16ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 103.9MB in the end (delta: -23.0MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-12-14 23:57:43,082 INFO L158 Benchmark]: CodeCheck took 71775.07ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 103.9MB in the beginning and 545.1MB in the end (delta: -441.2MB). Peak memory consumption was 812.8MB. Max. memory is 16.1GB. [2022-12-14 23:57:43,083 INFO L158 Benchmark]: Witness Printer took 136.70ms. Allocated memory is still 1.4GB. Free memory was 545.1MB in the beginning and 524.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 23:57:43,084 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.6s, OverallIterations: 125, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282872 SdHoareTripleChecker+Valid, 502.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278933 mSDsluCounter, 39263 SdHoareTripleChecker+Invalid, 430.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33165 mSDsCounter, 75975 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 616665 IncrementalHoareTripleChecker+Invalid, 692640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75975 mSolverCounterUnsat, 6098 mSDtfsCounter, 616665 mSolverCounterSat, 3.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127507 GetRequests, 123189 SyntacticMatches, 3432 SemanticMatches, 886 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514427 ImplicationChecksByTransitivity, 44.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 18792 NumberOfCodeBlocks, 18792 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 18432 ConstructedInterpolants, 0 QuantifiedInterpolants, 73393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 124 InterpolantComputations, 88 PerfectInterpolantSequences, 12628/14337 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: 414]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=2, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L234] a21 = 1 [L235] a8 = 14 [L236] a16 = 4 [L237] a20 = 0 [L238] a7 = 0 [L239] a17 = 0 [L240] return -1; VAL [\old(input)=2, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] reach_error() VAL [\old(input)=6, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, 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.21ms. Allocated memory is still 115.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.75ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 90.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.28ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 85.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.92ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 999.16ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 103.9MB in the end (delta: -23.0MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * CodeCheck took 71775.07ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 103.9MB in the beginning and 545.1MB in the end (delta: -441.2MB). Peak memory consumption was 812.8MB. Max. memory is 16.1GB. * Witness Printer took 136.70ms. Allocated memory is still 1.4GB. Free memory was 545.1MB in the beginning and 524.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 23:57:43,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b23e0af5-82aa-418b-94e9-5cbadc8ef2d7/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