./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI --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 a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 03:08:14,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 03:08:14,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 03:08:14,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 03:08:14,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 03:08:14,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 03:08:14,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 03:08:14,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 03:08:14,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 03:08:14,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 03:08:14,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 03:08:14,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 03:08:14,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 03:08:14,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 03:08:14,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 03:08:14,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 03:08:14,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 03:08:14,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 03:08:14,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 03:08:14,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 03:08:14,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 03:08:14,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 03:08:14,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 03:08:14,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 03:08:14,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 03:08:14,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 03:08:14,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 03:08:14,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 03:08:14,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 03:08:14,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 03:08:14,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 03:08:14,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 03:08:14,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 03:08:14,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 03:08:14,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 03:08:14,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 03:08:14,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 03:08:14,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 03:08:14,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 03:08:14,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 03:08:14,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 03:08:14,715 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 03:08:14,744 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 03:08:14,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 03:08:14,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 03:08:14,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 03:08:14,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 03:08:14,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 03:08:14,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 03:08:14,747 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 03:08:14,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 03:08:14,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 03:08:14,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 03:08:14,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 03:08:14,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 03:08:14,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 03:08:14,749 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 03:08:14,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 03:08:14,749 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 03:08:14,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 03:08:14,750 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 03:08:14,750 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 03:08:14,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 03:08:14,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:08:14,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 03:08:14,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 03:08:14,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 03:08:14,752 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 03:08:14,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 03:08:14,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 03:08:14,753 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_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/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_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI 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 -> a90366a5085659577cb1c98c7b11041979a96aff31e8f044fed2c2fa31b4a389 [2021-10-29 03:08:15,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 03:08:15,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 03:08:15,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 03:08:15,096 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 03:08:15,098 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 03:08:15,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2021-10-29 03:08:15,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/data/b64a3b684/682d2d82909a4547bef41ad8b05badfc/FLAGc00786723 [2021-10-29 03:08:15,993 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 03:08:16,002 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2021-10-29 03:08:16,025 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/data/b64a3b684/682d2d82909a4547bef41ad8b05badfc/FLAGc00786723 [2021-10-29 03:08:16,128 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/data/b64a3b684/682d2d82909a4547bef41ad8b05badfc [2021-10-29 03:08:16,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 03:08:16,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 03:08:16,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 03:08:16,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 03:08:16,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 03:08:16,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:08:16" (1/1) ... [2021-10-29 03:08:16,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326e4760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:16, skipping insertion in model container [2021-10-29 03:08:16,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:08:16" (1/1) ... [2021-10-29 03:08:16,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 03:08:16,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 03:08:16,835 WARN L228 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_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2021-10-29 03:08:16,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:08:16,908 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 03:08:16,994 WARN L228 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_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/sv-benchmarks/c/eca-rers2012/Problem01_label33.c[15127,15140] [2021-10-29 03:08:17,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:08:17,034 INFO L208 MainTranslator]: Completed translation [2021-10-29 03:08:17,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17 WrapperNode [2021-10-29 03:08:17,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 03:08:17,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 03:08:17,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 03:08:17,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 03:08:17,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 03:08:17,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 03:08:17,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 03:08:17,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 03:08:17,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 03:08:17,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 03:08:17,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 03:08:17,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 03:08:17,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:08:17" (1/1) ... [2021-10-29 03:08:17,240 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:08:17,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 03:08:17,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 03:08:17,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 03:08:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 03:08:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 03:08:17,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 03:08:17,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 03:08:19,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 03:08:19,312 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-29 03:08:19,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:08:19 BoogieIcfgContainer [2021-10-29 03:08:19,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 03:08:19,317 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 03:08:19,317 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 03:08:19,328 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 03:08:19,328 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:08:19" (1/1) ... [2021-10-29 03:08:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 03:08:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-10-29 03:08:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-10-29 03:08:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-29 03:08:19,391 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:19,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2021-10-29 03:08:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2021-10-29 03:08:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-29 03:08:20,235 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:20,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2021-10-29 03:08:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2021-10-29 03:08:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-10-29 03:08:20,580 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:20,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2021-10-29 03:08:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2021-10-29 03:08:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-29 03:08:20,757 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:20,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2021-10-29 03:08:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2021-10-29 03:08:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-29 03:08:20,969 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:20,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2021-10-29 03:08:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2021-10-29 03:08:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-29 03:08:21,186 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:21,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2021-10-29 03:08:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2021-10-29 03:08:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-29 03:08:21,367 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:21,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2021-10-29 03:08:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2021-10-29 03:08:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-29 03:08:21,523 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:21,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2021-10-29 03:08:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2021-10-29 03:08:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-29 03:08:21,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:21,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2021-10-29 03:08:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2021-10-29 03:08:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-29 03:08:22,433 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:22,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2021-10-29 03:08:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2021-10-29 03:08:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-29 03:08:23,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:23,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2021-10-29 03:08:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2021-10-29 03:08:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-29 03:08:23,923 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:23,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 232 states and 369 transitions. [2021-10-29 03:08:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2021-10-29 03:08:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-29 03:08:24,301 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:24,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 246 states and 387 transitions. [2021-10-29 03:08:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2021-10-29 03:08:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-29 03:08:24,862 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:24,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 251 states and 393 transitions. [2021-10-29 03:08:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 393 transitions. [2021-10-29 03:08:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-29 03:08:25,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:25,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 252 states and 394 transitions. [2021-10-29 03:08:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 394 transitions. [2021-10-29 03:08:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 03:08:25,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:25,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 271 states and 424 transitions. [2021-10-29 03:08:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 424 transitions. [2021-10-29 03:08:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 03:08:26,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:26,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 272 states and 425 transitions. [2021-10-29 03:08:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 425 transitions. [2021-10-29 03:08:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 03:08:26,525 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:26,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 287 states and 444 transitions. [2021-10-29 03:08:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 444 transitions. [2021-10-29 03:08:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-29 03:08:27,277 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:27,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 305 states and 464 transitions. [2021-10-29 03:08:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2021-10-29 03:08:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-29 03:08:28,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:28,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 309 states and 468 transitions. [2021-10-29 03:08:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 468 transitions. [2021-10-29 03:08:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-29 03:08:28,138 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:28,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 313 states and 475 transitions. [2021-10-29 03:08:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2021-10-29 03:08:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-29 03:08:28,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:28,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 314 states and 477 transitions. [2021-10-29 03:08:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2021-10-29 03:08:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:08:28,788 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:28,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 322 states and 492 transitions. [2021-10-29 03:08:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 492 transitions. [2021-10-29 03:08:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:08:29,509 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:29,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 328 states and 501 transitions. [2021-10-29 03:08:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2021-10-29 03:08:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:08:29,881 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:29,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 331 states and 506 transitions. [2021-10-29 03:08:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2021-10-29 03:08:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:08:30,157 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:30,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 346 states and 527 transitions. [2021-10-29 03:08:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2021-10-29 03:08:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-29 03:08:30,700 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:30,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 360 states and 544 transitions. [2021-10-29 03:08:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2021-10-29 03:08:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-29 03:08:31,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:31,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 362 states and 546 transitions. [2021-10-29 03:08:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2021-10-29 03:08:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 03:08:31,518 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:31,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 368 states and 553 transitions. [2021-10-29 03:08:31,890 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2021-10-29 03:08:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 03:08:31,891 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:31,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 372 states and 556 transitions. [2021-10-29 03:08:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 556 transitions. [2021-10-29 03:08:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 03:08:31,980 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:31,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 374 states and 559 transitions. [2021-10-29 03:08:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 559 transitions. [2021-10-29 03:08:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-29 03:08:32,120 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:32,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 388 states and 577 transitions. [2021-10-29 03:08:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 577 transitions. [2021-10-29 03:08:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-29 03:08:32,695 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:32,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 392 states and 582 transitions. [2021-10-29 03:08:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 582 transitions. [2021-10-29 03:08:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-29 03:08:33,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:33,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 394 states and 585 transitions. [2021-10-29 03:08:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 585 transitions. [2021-10-29 03:08:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:08:33,173 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:33,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 397 states and 589 transitions. [2021-10-29 03:08:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2021-10-29 03:08:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:08:33,290 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:33,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 406 states and 599 transitions. [2021-10-29 03:08:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2021-10-29 03:08:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:08:33,639 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:33,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 410 states and 602 transitions. [2021-10-29 03:08:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 602 transitions. [2021-10-29 03:08:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:08:33,915 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:33,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 413 states and 605 transitions. [2021-10-29 03:08:34,221 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2021-10-29 03:08:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-29 03:08:34,223 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:34,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 483 states and 683 transitions. [2021-10-29 03:08:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 683 transitions. [2021-10-29 03:08:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-10-29 03:08:34,809 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:34,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 497 states and 700 transitions. [2021-10-29 03:08:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 700 transitions. [2021-10-29 03:08:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-29 03:08:34,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:34,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 508 states and 714 transitions. [2021-10-29 03:08:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 714 transitions. [2021-10-29 03:08:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-10-29 03:08:35,133 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:35,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 532 states and 747 transitions. [2021-10-29 03:08:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 747 transitions. [2021-10-29 03:08:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-10-29 03:08:35,702 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:35,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 536 states and 751 transitions. [2021-10-29 03:08:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 751 transitions. [2021-10-29 03:08:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-29 03:08:35,989 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:35,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 538 states and 753 transitions. [2021-10-29 03:08:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 753 transitions. [2021-10-29 03:08:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-29 03:08:36,154 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:36,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 545 states and 760 transitions. [2021-10-29 03:08:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 760 transitions. [2021-10-29 03:08:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:08:36,406 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:36,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 583 states and 804 transitions. [2021-10-29 03:08:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 804 transitions. [2021-10-29 03:08:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:08:37,549 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:37,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 586 states and 806 transitions. [2021-10-29 03:08:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 806 transitions. [2021-10-29 03:08:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:08:37,845 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:37,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 589 states and 808 transitions. [2021-10-29 03:08:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 808 transitions. [2021-10-29 03:08:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:08:38,197 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:38,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 603 states and 825 transitions. [2021-10-29 03:08:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 825 transitions. [2021-10-29 03:08:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-29 03:08:38,522 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:38,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:08:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 612 states and 834 transitions. [2021-10-29 03:08:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 834 transitions. [2021-10-29 03:08:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-29 03:08:38,816 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:38,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 620 states and 843 transitions. [2021-10-29 03:08:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 843 transitions. [2021-10-29 03:08:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-29 03:08:39,068 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:39,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-10-29 03:08:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 717 states and 950 transitions. [2021-10-29 03:08:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 950 transitions. [2021-10-29 03:08:40,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-10-29 03:08:40,456 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:40,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:08:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 739 states and 973 transitions. [2021-10-29 03:08:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 973 transitions. [2021-10-29 03:08:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-10-29 03:08:41,082 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:41,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:08:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 742 states and 975 transitions. [2021-10-29 03:08:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 975 transitions. [2021-10-29 03:08:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-10-29 03:08:41,376 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:41,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 03:08:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 753 states and 988 transitions. [2021-10-29 03:08:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 988 transitions. [2021-10-29 03:08:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-10-29 03:08:41,977 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:41,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-10-29 03:08:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 767 states and 1005 transitions. [2021-10-29 03:08:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1005 transitions. [2021-10-29 03:08:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-10-29 03:08:42,425 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:42,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 786 states and 1025 transitions. [2021-10-29 03:08:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1025 transitions. [2021-10-29 03:08:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-10-29 03:08:42,783 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:42,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-29 03:08:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 791 states and 1029 transitions. [2021-10-29 03:08:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1029 transitions. [2021-10-29 03:08:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-10-29 03:08:43,016 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:43,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-29 03:08:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 796 states and 1033 transitions. [2021-10-29 03:08:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1033 transitions. [2021-10-29 03:08:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-10-29 03:08:43,279 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:43,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-29 03:08:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 799 states and 1036 transitions. [2021-10-29 03:08:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1036 transitions. [2021-10-29 03:08:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-10-29 03:08:43,392 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:43,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 822 states and 1059 transitions. [2021-10-29 03:08:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1059 transitions. [2021-10-29 03:08:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-10-29 03:08:43,644 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:43,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-10-29 03:08:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 823 states and 1059 transitions. [2021-10-29 03:08:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1059 transitions. [2021-10-29 03:08:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-29 03:08:43,759 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:43,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 843 states and 1079 transitions. [2021-10-29 03:08:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1079 transitions. [2021-10-29 03:08:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-29 03:08:44,208 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:44,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:08:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 845 states and 1082 transitions. [2021-10-29 03:08:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1082 transitions. [2021-10-29 03:08:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-29 03:08:44,556 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:44,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:08:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 872 states and 1110 transitions. [2021-10-29 03:08:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1110 transitions. [2021-10-29 03:08:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-10-29 03:08:44,797 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:44,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:08:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 903 states and 1145 transitions. [2021-10-29 03:08:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1145 transitions. [2021-10-29 03:08:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-29 03:08:45,918 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:45,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-29 03:08:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 936 states and 1183 transitions. [2021-10-29 03:08:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1183 transitions. [2021-10-29 03:08:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-29 03:08:46,310 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:46,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-29 03:08:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 949 states and 1201 transitions. [2021-10-29 03:08:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1201 transitions. [2021-10-29 03:08:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-29 03:08:46,733 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:46,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-29 03:08:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 953 states and 1204 transitions. [2021-10-29 03:08:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1204 transitions. [2021-10-29 03:08:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-29 03:08:47,178 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:47,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-29 03:08:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 958 states and 1209 transitions. [2021-10-29 03:08:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1209 transitions. [2021-10-29 03:08:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-29 03:08:47,660 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:47,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1031 states and 1309 transitions. [2021-10-29 03:08:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1309 transitions. [2021-10-29 03:08:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-29 03:08:51,661 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:51,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1043 states and 1318 transitions. [2021-10-29 03:08:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1318 transitions. [2021-10-29 03:08:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-29 03:08:52,751 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:52,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1056 states and 1334 transitions. [2021-10-29 03:08:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1334 transitions. [2021-10-29 03:08:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-29 03:08:53,923 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:53,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:08:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1060 states and 1339 transitions. [2021-10-29 03:08:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1339 transitions. [2021-10-29 03:08:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-10-29 03:08:54,378 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:54,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 03:08:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1112 states and 1409 transitions. [2021-10-29 03:08:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1409 transitions. [2021-10-29 03:08:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-10-29 03:08:56,418 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:56,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 03:08:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:08:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1137 states and 1438 transitions. [2021-10-29 03:08:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1438 transitions. [2021-10-29 03:08:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-29 03:08:57,390 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:08:57,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:08:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:08:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:09:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1223 states and 1555 transitions. [2021-10-29 03:09:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1555 transitions. [2021-10-29 03:09:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-10-29 03:09:01,685 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:01,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 03:09:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1261 states and 1595 transitions. [2021-10-29 03:09:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1595 transitions. [2021-10-29 03:09:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-10-29 03:09:03,279 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:03,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 03:09:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1294 states and 1626 transitions. [2021-10-29 03:09:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1626 transitions. [2021-10-29 03:09:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:09:04,091 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:04,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:09:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1315 states and 1645 transitions. [2021-10-29 03:09:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1645 transitions. [2021-10-29 03:09:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:09:04,872 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:04,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:09:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1318 states and 1647 transitions. [2021-10-29 03:09:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1647 transitions. [2021-10-29 03:09:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:09:05,135 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:05,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:09:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1324 states and 1654 transitions. [2021-10-29 03:09:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1654 transitions. [2021-10-29 03:09:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:09:05,774 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:05,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:09:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1333 states and 1663 transitions. [2021-10-29 03:09:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1663 transitions. [2021-10-29 03:09:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-10-29 03:09:06,285 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:06,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-29 03:09:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1335 states and 1664 transitions. [2021-10-29 03:09:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1664 transitions. [2021-10-29 03:09:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-10-29 03:09:06,808 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:06,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-29 03:09:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1360 states and 1691 transitions. [2021-10-29 03:09:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1691 transitions. [2021-10-29 03:09:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-10-29 03:09:07,964 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:07,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-29 03:09:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1364 states and 1694 transitions. [2021-10-29 03:09:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1694 transitions. [2021-10-29 03:09:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-29 03:09:08,397 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:08,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-10-29 03:09:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1387 states and 1720 transitions. [2021-10-29 03:09:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1720 transitions. [2021-10-29 03:09:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-29 03:09:09,468 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:09,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:09:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1391 states and 1723 transitions. [2021-10-29 03:09:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1723 transitions. [2021-10-29 03:09:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-29 03:09:10,237 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:10,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:09:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1395 states and 1726 transitions. [2021-10-29 03:09:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1726 transitions. [2021-10-29 03:09:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-10-29 03:09:11,065 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:11,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:09:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1434 states and 1765 transitions. [2021-10-29 03:09:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1765 transitions. [2021-10-29 03:09:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-29 03:09:11,576 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:11,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-29 03:09:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1435 states and 1765 transitions. [2021-10-29 03:09:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1765 transitions. [2021-10-29 03:09:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-29 03:09:11,730 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:11,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:09:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1497 states and 1833 transitions. [2021-10-29 03:09:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1833 transitions. [2021-10-29 03:09:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-29 03:09:14,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:14,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:09:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1508 states and 1842 transitions. [2021-10-29 03:09:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1842 transitions. [2021-10-29 03:09:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-29 03:09:14,633 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:14,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-10-29 03:09:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1520 states and 1856 transitions. [2021-10-29 03:09:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1856 transitions. [2021-10-29 03:09:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-29 03:09:15,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:15,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-29 03:09:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1529 states and 1865 transitions. [2021-10-29 03:09:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1865 transitions. [2021-10-29 03:09:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-29 03:09:15,618 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:15,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-29 03:09:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1531 states and 1866 transitions. [2021-10-29 03:09:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1866 transitions. [2021-10-29 03:09:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-10-29 03:09:15,849 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:15,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-10-29 03:09:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1538 states and 1873 transitions. [2021-10-29 03:09:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1873 transitions. [2021-10-29 03:09:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-29 03:09:16,686 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:16,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 145 proven. 23 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-10-29 03:09:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1572 states and 1914 transitions. [2021-10-29 03:09:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1914 transitions. [2021-10-29 03:09:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-29 03:09:19,277 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:19,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:09:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1574 states and 1915 transitions. [2021-10-29 03:09:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1915 transitions. [2021-10-29 03:09:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-29 03:09:19,882 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:19,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:09:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1576 states and 1916 transitions. [2021-10-29 03:09:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1916 transitions. [2021-10-29 03:09:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-29 03:09:20,127 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:20,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:09:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1578 states and 1917 transitions. [2021-10-29 03:09:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1917 transitions. [2021-10-29 03:09:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-10-29 03:09:20,526 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:20,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-10-29 03:09:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1579 states and 1917 transitions. [2021-10-29 03:09:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1917 transitions. [2021-10-29 03:09:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-10-29 03:09:20,658 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:20,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 194 proven. 35 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-10-29 03:09:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1604 states and 1945 transitions. [2021-10-29 03:09:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1945 transitions. [2021-10-29 03:09:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-10-29 03:09:22,046 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:22,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:09:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1606 states and 1947 transitions. [2021-10-29 03:09:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1947 transitions. [2021-10-29 03:09:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-10-29 03:09:22,251 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:22,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:09:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-10-29 03:09:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:09:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1608 states and 1948 transitions. [2021-10-29 03:09:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1948 transitions. [2021-10-29 03:09:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-10-29 03:09:22,336 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:09:22,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:09:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:09:22,380 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:09:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:09:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:09:22,645 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:09:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:09:22,839 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 106 iterations. [2021-10-29 03:09:23,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:09:23 ImpRootNode [2021-10-29 03:09:23,200 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:09:23,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:09:23,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:09:23,201 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:09:23,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:08:19" (3/4) ... [2021-10-29 03:09:23,204 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:09:23,406 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:09:23,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:09:23,408 INFO L168 Benchmark]: Toolchain (without parser) took 67269.76 ms. Allocated memory was 98.6 MB in the beginning and 658.5 MB in the end (delta: 559.9 MB). Free memory was 61.8 MB in the beginning and 370.0 MB in the end (delta: -308.2 MB). Peak memory consumption was 249.9 MB. Max. memory is 16.1 GB. [2021-10-29 03:09:23,408 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 98.6 MB. Free memory was 72.6 MB in the beginning and 72.6 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:09:23,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.90 ms. Allocated memory is still 98.6 MB. Free memory was 61.5 MB in the beginning and 57.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 03:09:23,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.48 ms. Allocated memory is still 98.6 MB. Free memory was 57.1 MB in the beginning and 51.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 03:09:23,410 INFO L168 Benchmark]: Boogie Preprocessor took 77.02 ms. Allocated memory is still 98.6 MB. Free memory was 51.4 MB in the beginning and 47.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:09:23,411 INFO L168 Benchmark]: RCFGBuilder took 2100.73 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 47.2 MB in the beginning and 52.8 MB in the end (delta: -5.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:09:23,411 INFO L168 Benchmark]: CodeCheck took 63883.87 ms. Allocated memory was 119.5 MB in the beginning and 658.5 MB in the end (delta: 539.0 MB). Free memory was 52.8 MB in the beginning and 403.6 MB in the end (delta: -350.8 MB). Peak memory consumption was 188.0 MB. Max. memory is 16.1 GB. [2021-10-29 03:09:23,412 INFO L168 Benchmark]: Witness Printer took 205.09 ms. Allocated memory is still 658.5 MB. Free memory was 403.6 MB in the beginning and 370.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-10-29 03:09:23,414 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: 63.4s, OverallIterations: 106, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: -514842112 SDtfs, -383073364 SDslu, 937479168 SDs, 0 SdLazy, -589634144 SolverSat, -1677195680 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 353.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99947 GetRequests, 96584 SyntacticMatches, 2659 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309459 ImplicationChecksByTransitivity, 44.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 14189 NumberOfCodeBlocks, 14189 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 13871 ConstructedInterpolants, 0 QuantifiedInterpolants, 41251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 105 InterpolantComputations, 98 PerfectInterpolantSequences, 8548/8758 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: 417]: 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, 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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) 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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L113] a20 = 0 [L114] a8 = 15 [L115] a17 = 0 [L116] a21 = 1 [L117] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] reach_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 98.6 MB. Free memory was 72.6 MB in the beginning and 72.6 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 890.90 ms. Allocated memory is still 98.6 MB. Free memory was 61.5 MB in the beginning and 57.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 100.48 ms. Allocated memory is still 98.6 MB. Free memory was 57.1 MB in the beginning and 51.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.02 ms. Allocated memory is still 98.6 MB. Free memory was 51.4 MB in the beginning and 47.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2100.73 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 47.2 MB in the beginning and 52.8 MB in the end (delta: -5.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. * CodeCheck took 63883.87 ms. Allocated memory was 119.5 MB in the beginning and 658.5 MB in the end (delta: 539.0 MB). Free memory was 52.8 MB in the beginning and 403.6 MB in the end (delta: -350.8 MB). Peak memory consumption was 188.0 MB. Max. memory is 16.1 GB. * Witness Printer took 205.09 ms. Allocated memory is still 658.5 MB. Free memory was 403.6 MB in the beginning and 370.0 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 03:09:23,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ccb06c-1fb6-4ff4-ad6f-e27ca88aca7b/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...