./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label15.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_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/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_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label15.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/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_98eb2ba0-256c-482f-af43-0a9a359702bc/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 ed249da04373d4759cadf5f52529e2266bc29efebb28f8cb64ff404bc3283b78 --- 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 20:34:15,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 20:34:15,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 20:34:15,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 20:34:15,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 20:34:15,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 20:34:15,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 20:34:15,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 20:34:15,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 20:34:15,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 20:34:15,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 20:34:15,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 20:34:15,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 20:34:15,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 20:34:15,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 20:34:15,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 20:34:15,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 20:34:15,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 20:34:15,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 20:34:15,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 20:34:15,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 20:34:15,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 20:34:15,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 20:34:15,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 20:34:15,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 20:34:15,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 20:34:15,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 20:34:15,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 20:34:15,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 20:34:15,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 20:34:15,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 20:34:15,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 20:34:15,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 20:34:15,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 20:34:15,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 20:34:15,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 20:34:15,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 20:34:15,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 20:34:15,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 20:34:15,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 20:34:15,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 20:34:15,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 20:34:15,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 20:34:15,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 20:34:15,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 20:34:15,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 20:34:15,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 20:34:15,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 20:34:15,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 20:34:15,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 20:34:15,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 20:34:15,893 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 20:34:15,893 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 20:34:15,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 20:34:15,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:34:15,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 20:34:15,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 20:34:15,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 20:34:15,894 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 20:34:15,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 20:34:15,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 20:34:15,894 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_98eb2ba0-256c-482f-af43-0a9a359702bc/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_98eb2ba0-256c-482f-af43-0a9a359702bc/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 -> ed249da04373d4759cadf5f52529e2266bc29efebb28f8cb64ff404bc3283b78 [2022-12-14 20:34:16,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 20:34:16,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 20:34:16,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 20:34:16,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 20:34:16,081 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 20:34:16,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label15.c [2022-12-14 20:34:18,707 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 20:34:18,879 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 20:34:18,879 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/sv-benchmarks/c/eca-rers2012/Problem01_label15.c [2022-12-14 20:34:18,886 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/data/280df398a/0f58764d1f574e6ab6c7691039f91997/FLAG365458697 [2022-12-14 20:34:18,900 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/data/280df398a/0f58764d1f574e6ab6c7691039f91997 [2022-12-14 20:34:18,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 20:34:18,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 20:34:18,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 20:34:18,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 20:34:18,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 20:34:18,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:34:18" (1/1) ... [2022-12-14 20:34:18,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfadcb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:18, skipping insertion in model container [2022-12-14 20:34:18,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:34:18" (1/1) ... [2022-12-14 20:34:18,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 20:34:18,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 20:34:19,162 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_98eb2ba0-256c-482f-af43-0a9a359702bc/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] [2022-12-14 20:34:19,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:34:19,199 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 20:34:19,246 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_98eb2ba0-256c-482f-af43-0a9a359702bc/sv-benchmarks/c/eca-rers2012/Problem01_label15.c[15626,15639] [2022-12-14 20:34:19,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:34:19,268 INFO L208 MainTranslator]: Completed translation [2022-12-14 20:34:19,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19 WrapperNode [2022-12-14 20:34:19,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 20:34:19,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 20:34:19,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 20:34:19,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 20:34:19,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,315 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 20:34:19,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 20:34:19,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 20:34:19,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 20:34:19,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 20:34:19,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,344 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 20:34:19,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 20:34:19,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 20:34:19,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 20:34:19,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:34:19" (1/1) ... [2022-12-14 20:34:19,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:34:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 20:34:19,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 20:34:19,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 20:34:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 20:34:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 20:34:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 20:34:19,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 20:34:19,466 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 20:34:19,468 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 20:34:20,215 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 20:34:20,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 20:34:20,397 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 20:34:20,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:34:20 BoogieIcfgContainer [2022-12-14 20:34:20,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 20:34:20,401 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 20:34:20,401 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 20:34:20,410 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 20:34:20,410 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:34:20" (1/1) ... [2022-12-14 20:34:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 20:34:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 20:34:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 20:34:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 20:34:20,477 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:20,783 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 20:34:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2022-12-14 20:34:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2022-12-14 20:34:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 20:34:21,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2022-12-14 20:34:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2022-12-14 20:34:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 20:34:21,742 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2022-12-14 20:34:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2022-12-14 20:34:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 20:34:21,880 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 290 states and 430 transitions. [2022-12-14 20:34:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 430 transitions. [2022-12-14 20:34:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 20:34:22,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 300 states and 443 transitions. [2022-12-14 20:34:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2022-12-14 20:34:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 20:34:22,679 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 311 states and 459 transitions. [2022-12-14 20:34:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 459 transitions. [2022-12-14 20:34:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 20:34:23,149 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 321 states and 470 transitions. [2022-12-14 20:34:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 470 transitions. [2022-12-14 20:34:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 20:34:23,358 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 326 states and 475 transitions. [2022-12-14 20:34:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 475 transitions. [2022-12-14 20:34:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 20:34:23,549 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:23,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:34:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 337 states and 488 transitions. [2022-12-14 20:34:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 488 transitions. [2022-12-14 20:34:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 20:34:23,836 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 345 states and 501 transitions. [2022-12-14 20:34:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 501 transitions. [2022-12-14 20:34:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 20:34:24,097 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 351 states and 511 transitions. [2022-12-14 20:34:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 511 transitions. [2022-12-14 20:34:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 20:34:24,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2022-12-14 20:34:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2022-12-14 20:34:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 20:34:24,567 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 361 states and 524 transitions. [2022-12-14 20:34:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 524 transitions. [2022-12-14 20:34:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 20:34:24,654 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:24,746 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 20:34:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 381 states and 547 transitions. [2022-12-14 20:34:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 547 transitions. [2022-12-14 20:34:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 20:34:25,142 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 389 states and 557 transitions. [2022-12-14 20:34:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 557 transitions. [2022-12-14 20:34:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 20:34:25,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 391 states and 559 transitions. [2022-12-14 20:34:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 559 transitions. [2022-12-14 20:34:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 20:34:25,565 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 393 states and 561 transitions. [2022-12-14 20:34:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 561 transitions. [2022-12-14 20:34:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 20:34:25,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:25,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 404 states and 574 transitions. [2022-12-14 20:34:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 574 transitions. [2022-12-14 20:34:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 20:34:26,144 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 409 states and 579 transitions. [2022-12-14 20:34:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 579 transitions. [2022-12-14 20:34:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 20:34:26,339 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:26,457 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 20:34:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 426 states and 598 transitions. [2022-12-14 20:34:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 598 transitions. [2022-12-14 20:34:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 20:34:26,631 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:26,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:26,729 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 20:34:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 456 states and 634 transitions. [2022-12-14 20:34:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 634 transitions. [2022-12-14 20:34:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 20:34:27,172 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:27,249 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 20:34:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 478 states and 657 transitions. [2022-12-14 20:34:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 657 transitions. [2022-12-14 20:34:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 20:34:27,582 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:34:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 497 states and 677 transitions. [2022-12-14 20:34:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 677 transitions. [2022-12-14 20:34:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 20:34:27,857 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 511 states and 691 transitions. [2022-12-14 20:34:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 691 transitions. [2022-12-14 20:34:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 20:34:28,070 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 540 states and 724 transitions. [2022-12-14 20:34:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 724 transitions. [2022-12-14 20:34:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 20:34:28,977 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 568 states and 753 transitions. [2022-12-14 20:34:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 753 transitions. [2022-12-14 20:34:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 20:34:29,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 584 states and 772 transitions. [2022-12-14 20:34:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 772 transitions. [2022-12-14 20:34:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-12-14 20:34:29,625 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 20:34:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 595 states and 784 transitions. [2022-12-14 20:34:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 784 transitions. [2022-12-14 20:34:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-14 20:34:29,867 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 652 states and 868 transitions. [2022-12-14 20:34:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 868 transitions. [2022-12-14 20:34:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-14 20:34:31,054 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 707 states and 932 transitions. [2022-12-14 20:34:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 932 transitions. [2022-12-14 20:34:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-14 20:34:31,784 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 20:34:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 710 states and 936 transitions. [2022-12-14 20:34:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 936 transitions. [2022-12-14 20:34:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 20:34:31,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 20:34:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 713 states and 940 transitions. [2022-12-14 20:34:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 940 transitions. [2022-12-14 20:34:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 20:34:32,255 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 20:34:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 716 states and 944 transitions. [2022-12-14 20:34:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 944 transitions. [2022-12-14 20:34:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 20:34:32,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 20:34:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 745 states and 974 transitions. [2022-12-14 20:34:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 974 transitions. [2022-12-14 20:34:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 20:34:32,915 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 767 states and 999 transitions. [2022-12-14 20:34:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 999 transitions. [2022-12-14 20:34:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 20:34:33,525 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:33,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 796 states and 1029 transitions. [2022-12-14 20:34:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1029 transitions. [2022-12-14 20:34:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 20:34:34,059 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 811 states and 1047 transitions. [2022-12-14 20:34:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1047 transitions. [2022-12-14 20:34:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 20:34:34,217 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:34,294 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 20:34:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 843 states and 1082 transitions. [2022-12-14 20:34:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1082 transitions. [2022-12-14 20:34:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 20:34:34,598 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 20:34:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 858 states and 1099 transitions. [2022-12-14 20:34:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1099 transitions. [2022-12-14 20:34:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 20:34:34,875 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 20:34:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 872 states and 1113 transitions. [2022-12-14 20:34:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1113 transitions. [2022-12-14 20:34:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 20:34:35,125 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:35,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 942 states and 1191 transitions. [2022-12-14 20:34:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1191 transitions. [2022-12-14 20:34:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 20:34:35,978 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:34:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 981 states and 1234 transitions. [2022-12-14 20:34:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1234 transitions. [2022-12-14 20:34:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 20:34:36,421 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:34:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1020 states and 1275 transitions. [2022-12-14 20:34:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1275 transitions. [2022-12-14 20:34:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 20:34:37,042 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 20:34:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1021 states and 1275 transitions. [2022-12-14 20:34:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1275 transitions. [2022-12-14 20:34:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 20:34:37,324 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:37,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:37,440 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 20:34:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1049 states and 1304 transitions. [2022-12-14 20:34:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1304 transitions. [2022-12-14 20:34:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 20:34:37,843 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1120 states and 1375 transitions. [2022-12-14 20:34:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1375 transitions. [2022-12-14 20:34:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 20:34:38,714 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1139 states and 1397 transitions. [2022-12-14 20:34:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1397 transitions. [2022-12-14 20:34:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-14 20:34:39,550 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1158 states and 1418 transitions. [2022-12-14 20:34:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1418 transitions. [2022-12-14 20:34:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 20:34:40,300 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1160 states and 1422 transitions. [2022-12-14 20:34:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1422 transitions. [2022-12-14 20:34:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 20:34:40,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:34:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1161 states and 1423 transitions. [2022-12-14 20:34:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1423 transitions. [2022-12-14 20:34:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 20:34:40,901 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 20:34:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1186 states and 1451 transitions. [2022-12-14 20:34:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1451 transitions. [2022-12-14 20:34:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-14 20:34:41,351 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 20:34:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1210 states and 1477 transitions. [2022-12-14 20:34:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1477 transitions. [2022-12-14 20:34:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 20:34:41,603 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1257 states and 1537 transitions. [2022-12-14 20:34:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1537 transitions. [2022-12-14 20:34:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 20:34:42,503 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:42,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1303 states and 1594 transitions. [2022-12-14 20:34:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1594 transitions. [2022-12-14 20:34:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 20:34:43,319 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1308 states and 1599 transitions. [2022-12-14 20:34:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1599 transitions. [2022-12-14 20:34:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 20:34:43,481 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:34:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1310 states and 1601 transitions. [2022-12-14 20:34:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1601 transitions. [2022-12-14 20:34:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-12-14 20:34:43,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:34:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1311 states and 1601 transitions. [2022-12-14 20:34:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1601 transitions. [2022-12-14 20:34:44,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 20:34:44,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 20:34:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1314 states and 1604 transitions. [2022-12-14 20:34:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1604 transitions. [2022-12-14 20:34:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 20:34:44,258 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:44,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 20:34:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1317 states and 1607 transitions. [2022-12-14 20:34:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1607 transitions. [2022-12-14 20:34:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 20:34:44,457 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:44,551 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 20:34:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1355 states and 1649 transitions. [2022-12-14 20:34:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1649 transitions. [2022-12-14 20:34:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 20:34:45,209 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:45,302 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 20:34:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1357 states and 1650 transitions. [2022-12-14 20:34:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1650 transitions. [2022-12-14 20:34:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 20:34:45,458 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:45,549 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 20:34:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1358 states and 1650 transitions. [2022-12-14 20:34:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1650 transitions. [2022-12-14 20:34:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 20:34:45,715 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:45,804 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 20:34:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1368 states and 1659 transitions. [2022-12-14 20:34:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1659 transitions. [2022-12-14 20:34:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 20:34:46,006 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 159 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1458 states and 1766 transitions. [2022-12-14 20:34:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1766 transitions. [2022-12-14 20:34:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 20:34:48,587 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 159 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1546 states and 1865 transitions. [2022-12-14 20:34:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1865 transitions. [2022-12-14 20:34:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 20:34:50,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 159 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1562 states and 1885 transitions. [2022-12-14 20:34:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1885 transitions. [2022-12-14 20:34:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 20:34:51,201 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:51,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 159 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1578 states and 1907 transitions. [2022-12-14 20:34:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1907 transitions. [2022-12-14 20:34:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 20:34:51,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:51,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 159 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1594 states and 1926 transitions. [2022-12-14 20:34:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1926 transitions. [2022-12-14 20:34:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-14 20:34:52,267 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:52,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 159 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:34:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1599 states and 1930 transitions. [2022-12-14 20:34:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1930 transitions. [2022-12-14 20:34:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:34:52,702 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1682 states and 2036 transitions. [2022-12-14 20:34:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2036 transitions. [2022-12-14 20:34:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:34:56,979 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:56,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:34:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:34:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 1764 states and 2138 transitions. [2022-12-14 20:34:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2138 transitions. [2022-12-14 20:34:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:34:59,684 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:34:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:34:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:34:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 1781 states and 2161 transitions. [2022-12-14 20:35:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2161 transitions. [2022-12-14 20:35:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:00,511 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 1797 states and 2182 transitions. [2022-12-14 20:35:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2182 transitions. [2022-12-14 20:35:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:01,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1811 states and 2195 transitions. [2022-12-14 20:35:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2195 transitions. [2022-12-14 20:35:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:01,677 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1827 states and 2217 transitions. [2022-12-14 20:35:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2217 transitions. [2022-12-14 20:35:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:02,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1842 states and 2233 transitions. [2022-12-14 20:35:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2233 transitions. [2022-12-14 20:35:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:03,303 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 1843 states and 2234 transitions. [2022-12-14 20:35:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2234 transitions. [2022-12-14 20:35:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:03,816 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 1857 states and 2247 transitions. [2022-12-14 20:35:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2247 transitions. [2022-12-14 20:35:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:04,366 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:04,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:35:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1859 states and 2251 transitions. [2022-12-14 20:35:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2251 transitions. [2022-12-14 20:35:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:35:04,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:35:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 1860 states and 2253 transitions. [2022-12-14 20:35:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2253 transitions. [2022-12-14 20:35:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 20:35:04,732 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-14 20:35:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1876 states and 2268 transitions. [2022-12-14 20:35:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2268 transitions. [2022-12-14 20:35:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 20:35:05,124 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-14 20:35:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 1892 states and 2283 transitions. [2022-12-14 20:35:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2283 transitions. [2022-12-14 20:35:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-12-14 20:35:05,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:35:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 1962 states and 2355 transitions. [2022-12-14 20:35:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2355 transitions. [2022-12-14 20:35:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:06,366 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:06,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:35:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2031 states and 2435 transitions. [2022-12-14 20:35:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2435 transitions. [2022-12-14 20:35:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:09,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:35:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2070 states and 2475 transitions. [2022-12-14 20:35:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2475 transitions. [2022-12-14 20:35:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:10,724 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:35:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2086 states and 2493 transitions. [2022-12-14 20:35:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2493 transitions. [2022-12-14 20:35:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:11,218 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:35:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2102 states and 2511 transitions. [2022-12-14 20:35:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2511 transitions. [2022-12-14 20:35:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:11,872 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 20:35:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2119 states and 2527 transitions. [2022-12-14 20:35:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2527 transitions. [2022-12-14 20:35:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:12,436 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:12,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 20:35:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2121 states and 2528 transitions. [2022-12-14 20:35:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2528 transitions. [2022-12-14 20:35:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:12,823 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 20:35:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2137 states and 2544 transitions. [2022-12-14 20:35:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2544 transitions. [2022-12-14 20:35:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:13,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 20:35:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2149 states and 2554 transitions. [2022-12-14 20:35:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2554 transitions. [2022-12-14 20:35:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:13,868 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 20:35:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2150 states and 2554 transitions. [2022-12-14 20:35:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2554 transitions. [2022-12-14 20:35:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:35:14,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 20:35:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2160 states and 2563 transitions. [2022-12-14 20:35:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2563 transitions. [2022-12-14 20:35:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 20:35:14,708 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:35:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2230 states and 2635 transitions. [2022-12-14 20:35:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2635 transitions. [2022-12-14 20:35:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-14 20:35:15,464 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2288 states and 2702 transitions. [2022-12-14 20:35:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2702 transitions. [2022-12-14 20:35:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-14 20:35:18,783 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2318 states and 2732 transitions. [2022-12-14 20:35:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2732 transitions. [2022-12-14 20:35:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-14 20:35:19,559 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 164 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:35:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2339 states and 2756 transitions. [2022-12-14 20:35:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 2756 transitions. [2022-12-14 20:35:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-14 20:35:21,096 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:21,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-14 20:35:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2341 states and 2758 transitions. [2022-12-14 20:35:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2758 transitions. [2022-12-14 20:35:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-14 20:35:21,456 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:35:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-14 20:35:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:35:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2342 states and 2758 transitions. [2022-12-14 20:35:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 2758 transitions. [2022-12-14 20:35:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 20:35:21,765 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:35:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:35:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:35:21,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:35:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:35:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:35:22,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:35:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:35:22,089 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 100 iterations. [2022-12-14 20:35:22,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 08:35:22 ImpRootNode [2022-12-14 20:35:22,229 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 20:35:22,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 20:35:22,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 20:35:22,229 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 20:35:22,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:34:20" (3/4) ... [2022-12-14 20:35:22,231 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 20:35:22,340 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 20:35:22,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 20:35:22,341 INFO L158 Benchmark]: Toolchain (without parser) took 63437.27ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.5MB in the beginning and 629.1MB in the end (delta: -524.5MB). Peak memory consumption was 587.7MB. Max. memory is 16.1GB. [2022-12-14 20:35:22,341 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 20:35:22,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.00ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 120.0MB in the end (delta: -15.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-12-14 20:35:22,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.30ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 113.9MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 20:35:22,342 INFO L158 Benchmark]: Boogie Preprocessor took 35.78ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 109.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 20:35:22,342 INFO L158 Benchmark]: RCFGBuilder took 1048.10ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 118.3MB in the end (delta: -8.6MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2022-12-14 20:35:22,342 INFO L158 Benchmark]: CodeCheck took 61828.05ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.3MB in the beginning and 649.0MB in the end (delta: -530.7MB). Peak memory consumption was 578.7MB. Max. memory is 16.1GB. [2022-12-14 20:35:22,342 INFO L158 Benchmark]: Witness Printer took 111.67ms. Allocated memory is still 1.3GB. Free memory was 649.0MB in the beginning and 629.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 20:35:22,343 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: 61.7s, OverallIterations: 100, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236825 SdHoareTripleChecker+Valid, 463.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235359 mSDsluCounter, 34978 SdHoareTripleChecker+Invalid, 397.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29549 mSDsCounter, 74517 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 537181 IncrementalHoareTripleChecker+Invalid, 611698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74517 mSolverCounterUnsat, 5429 mSDtfsCounter, 537181 mSolverCounterSat, 3.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107223 GetRequests, 102746 SyntacticMatches, 3777 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335480 ImplicationChecksByTransitivity, 35.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 15383 NumberOfCodeBlocks, 15383 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 15068 ConstructedInterpolants, 0 QuantifiedInterpolants, 64860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 76 PerfectInterpolantSequences, 11162/12165 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: 429]: 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)=4, 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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L188] COND TRUE ((((((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)) [L189] a17 = 0 [L190] a16 = 5 [L191] a21 = 1 [L192] a8 = 14 [L193] a7 = 1 [L194] a20 = 1 [L195] return -1; VAL [\old(input)=4, \result=-1, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, 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 calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, 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=0, a20=1, a21=1, a7=1, a8=14, 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=0, a20=1, a21=1, a7=1, a8=14, 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=0, a20=1, a21=1, a7=1, a8=14, 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=0, a20=1, a21=1, a7=1, a8=14, 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=0, a20=1, a21=1, a7=1, a8=14, 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 FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L428] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L429] reach_error() VAL [\old(input)=3, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, 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.16ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.00ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 120.0MB in the end (delta: -15.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.30ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 113.9MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.78ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 109.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.10ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 118.3MB in the end (delta: -8.6MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * CodeCheck took 61828.05ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.3MB in the beginning and 649.0MB in the end (delta: -530.7MB). Peak memory consumption was 578.7MB. Max. memory is 16.1GB. * Witness Printer took 111.67ms. Allocated memory is still 1.3GB. Free memory was 649.0MB in the beginning and 629.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 20:35:22,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98eb2ba0-256c-482f-af43-0a9a359702bc/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