./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB --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 f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 16:41:32,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 16:41:32,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 16:41:32,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 16:41:32,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 16:41:32,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 16:41:32,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 16:41:32,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 16:41:32,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 16:41:32,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 16:41:32,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 16:41:32,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 16:41:32,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 16:41:32,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 16:41:32,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 16:41:32,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 16:41:32,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 16:41:32,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 16:41:32,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 16:41:32,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 16:41:32,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 16:41:32,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 16:41:32,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 16:41:32,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 16:41:32,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 16:41:32,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 16:41:32,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 16:41:32,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 16:41:32,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 16:41:32,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 16:41:32,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 16:41:32,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 16:41:32,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 16:41:32,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 16:41:32,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 16:41:32,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 16:41:32,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 16:41:32,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 16:41:32,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 16:41:32,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 16:41:32,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 16:41:32,258 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-10-17 16:41:32,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 16:41:32,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 16:41:32,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 16:41:32,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-10-17 16:41:32,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 16:41:32,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 16:41:32,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 16:41:32,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 16:41:32,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 16:41:32,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 16:41:32,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 16:41:32,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 16:41:32,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 16:41:32,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 16:41:32,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 16:41:32,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 16:41:32,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 16:41:32,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 16:41:32,312 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-10-17 16:41:32,312 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-10-17 16:41:32,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 16:41:32,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-10-17 16:41:32,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 16:41:32,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 16:41:32,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 16:41:32,313 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-10-17 16:41:32,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 16:41:32,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 16:41:32,316 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_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/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_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB 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 -> f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 [2022-10-17 16:41:32,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 16:41:32,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 16:41:32,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 16:41:32,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 16:41:32,693 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 16:41:32,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2022-10-17 16:41:32,771 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/data/0b5ab6bce/3e9557293f264b608a07030a44e85b73/FLAG7a4bdcede [2022-10-17 16:41:33,372 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 16:41:33,380 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2022-10-17 16:41:33,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/data/0b5ab6bce/3e9557293f264b608a07030a44e85b73/FLAG7a4bdcede [2022-10-17 16:41:33,595 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/data/0b5ab6bce/3e9557293f264b608a07030a44e85b73 [2022-10-17 16:41:33,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 16:41:33,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 16:41:33,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 16:41:33,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 16:41:33,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 16:41:33,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:41:33" (1/1) ... [2022-10-17 16:41:33,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207a8668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:33, skipping insertion in model container [2022-10-17 16:41:33,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:41:33" (1/1) ... [2022-10-17 16:41:33,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 16:41:33,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 16:41:34,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2022-10-17 16:41:34,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 16:41:34,149 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 16:41:34,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2022-10-17 16:41:34,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 16:41:34,257 INFO L208 MainTranslator]: Completed translation [2022-10-17 16:41:34,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34 WrapperNode [2022-10-17 16:41:34,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 16:41:34,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 16:41:34,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 16:41:34,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 16:41:34,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,344 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-10-17 16:41:34,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 16:41:34,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 16:41:34,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 16:41:34,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 16:41:34,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,397 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 16:41:34,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 16:41:34,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 16:41:34,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 16:41:34,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:41:34" (1/1) ... [2022-10-17 16:41:34,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-10-17 16:41:34,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/z3 [2022-10-17 16:41:34,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-10-17 16:41:34,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-10-17 16:41:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 16:41:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 16:41:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 16:41:34,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 16:41:34,573 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 16:41:34,575 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 16:41:35,848 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 16:41:36,205 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 16:41:36,205 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-17 16:41:36,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:41:36 BoogieIcfgContainer [2022-10-17 16:41:36,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 16:41:36,211 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-10-17 16:41:36,212 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-10-17 16:41:36,223 INFO L275 PluginConnector]: CodeCheck initialized [2022-10-17 16:41:36,224 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:41:36" (1/1) ... [2022-10-17 16:41:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 16:41:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2022-10-17 16:41:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2022-10-17 16:41:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-17 16:41:36,327 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2022-10-17 16:41:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2022-10-17 16:41:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-17 16:41:37,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2022-10-17 16:41:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2022-10-17 16:41:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-17 16:41:37,992 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 16:41:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 167 states and 246 transitions. [2022-10-17 16:41:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2022-10-17 16:41:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-17 16:41:38,479 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 177 states and 264 transitions. [2022-10-17 16:41:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2022-10-17 16:41:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-10-17 16:41:38,833 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 189 states and 283 transitions. [2022-10-17 16:41:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 283 transitions. [2022-10-17 16:41:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-10-17 16:41:39,586 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 192 states and 286 transitions. [2022-10-17 16:41:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-10-17 16:41:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-17 16:41:39,849 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-17 16:41:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 195 states and 290 transitions. [2022-10-17 16:41:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 290 transitions. [2022-10-17 16:41:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-17 16:41:40,153 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 208 states and 313 transitions. [2022-10-17 16:41:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 313 transitions. [2022-10-17 16:41:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-17 16:41:40,599 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:40,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-17 16:41:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 212 states and 321 transitions. [2022-10-17 16:41:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2022-10-17 16:41:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-17 16:41:41,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-17 16:41:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 221 states and 333 transitions. [2022-10-17 16:41:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 333 transitions. [2022-10-17 16:41:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-10-17 16:41:41,596 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 233 states and 348 transitions. [2022-10-17 16:41:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 348 transitions. [2022-10-17 16:41:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-17 16:41:41,997 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-17 16:41:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 236 states and 355 transitions. [2022-10-17 16:41:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2022-10-17 16:41:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-17 16:41:42,485 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-17 16:41:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 239 states and 359 transitions. [2022-10-17 16:41:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 359 transitions. [2022-10-17 16:41:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-17 16:41:42,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 252 states and 383 transitions. [2022-10-17 16:41:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 383 transitions. [2022-10-17 16:41:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-17 16:41:43,385 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 253 states and 383 transitions. [2022-10-17 16:41:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 383 transitions. [2022-10-17 16:41:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-17 16:41:43,564 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 260 states and 392 transitions. [2022-10-17 16:41:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2022-10-17 16:41:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-17 16:41:43,985 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-17 16:41:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 261 states and 392 transitions. [2022-10-17 16:41:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2022-10-17 16:41:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-10-17 16:41:44,260 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-17 16:41:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 265 states and 399 transitions. [2022-10-17 16:41:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2022-10-17 16:41:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-17 16:41:44,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-17 16:41:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 272 states and 411 transitions. [2022-10-17 16:41:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 411 transitions. [2022-10-17 16:41:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-17 16:41:45,642 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-17 16:41:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 278 states and 418 transitions. [2022-10-17 16:41:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 418 transitions. [2022-10-17 16:41:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-17 16:41:46,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-17 16:41:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 282 states and 423 transitions. [2022-10-17 16:41:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 423 transitions. [2022-10-17 16:41:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-17 16:41:46,670 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 16:41:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 301 states and 448 transitions. [2022-10-17 16:41:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 448 transitions. [2022-10-17 16:41:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-17 16:41:47,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 16:41:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 309 states and 457 transitions. [2022-10-17 16:41:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 457 transitions. [2022-10-17 16:41:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-17 16:41:47,809 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 16:41:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 16:41:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-10-17 16:41:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 310 states and 457 transitions. [2022-10-17 16:41:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 457 transitions. [2022-10-17 16:41:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-17 16:41:47,907 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-10-17 16:41:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 16:41:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:41:47,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 16:41:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:41:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:41:48,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 16:41:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 16:41:48,163 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 25 iterations. [2022-10-17 16:41:48,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 17.10 04:41:48 ImpRootNode [2022-10-17 16:41:48,331 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-10-17 16:41:48,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 16:41:48,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 16:41:48,332 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 16:41:48,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:41:36" (3/4) ... [2022-10-17 16:41:48,335 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 16:41:48,595 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/witness.graphml [2022-10-17 16:41:48,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 16:41:48,596 INFO L158 Benchmark]: Toolchain (without parser) took 14997.16ms. Allocated memory was 81.8MB in the beginning and 272.6MB in the end (delta: 190.8MB). Free memory was 44.4MB in the beginning and 85.2MB in the end (delta: -40.9MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. [2022-10-17 16:41:48,597 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 81.8MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 50.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 16:41:48,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.61ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 44.2MB in the beginning and 65.3MB in the end (delta: -21.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 16:41:48,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.10ms. Allocated memory is still 107.0MB. Free memory was 65.3MB in the beginning and 59.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 16:41:48,599 INFO L158 Benchmark]: Boogie Preprocessor took 64.21ms. Allocated memory is still 107.0MB. Free memory was 59.6MB in the beginning and 55.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 16:41:48,599 INFO L158 Benchmark]: RCFGBuilder took 1799.51ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 55.3MB in the beginning and 82.7MB in the end (delta: -27.3MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-10-17 16:41:48,600 INFO L158 Benchmark]: CodeCheck took 12119.84ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 82.7MB in the beginning and 95.6MB in the end (delta: -12.9MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2022-10-17 16:41:48,600 INFO L158 Benchmark]: Witness Printer took 264.19ms. Allocated memory is still 272.6MB. Free memory was 95.6MB in the beginning and 85.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 16:41:48,603 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 25, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10526 SdHoareTripleChecker+Valid, 29.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8544 mSDsluCounter, 2113 SdHoareTripleChecker+Invalid, 23.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1691 mSDsCounter, 5625 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21267 IncrementalHoareTripleChecker+Invalid, 26892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5625 mSolverCounterUnsat, 422 mSDtfsCounter, 21267 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16007 GetRequests, 15800 SyntacticMatches, 29 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15654 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2498 NumberOfCodeBlocks, 2498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2367 ConstructedInterpolants, 0 QuantifiedInterpolants, 3393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 608/616 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: 443]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\old(input)=1, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [\old(input)=1, \result=-1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [\old(input)=1, a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 81.8MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 50.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.61ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 44.2MB in the beginning and 65.3MB in the end (delta: -21.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.10ms. Allocated memory is still 107.0MB. Free memory was 65.3MB in the beginning and 59.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.21ms. Allocated memory is still 107.0MB. Free memory was 59.6MB in the beginning and 55.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1799.51ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 55.3MB in the beginning and 82.7MB in the end (delta: -27.3MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * CodeCheck took 12119.84ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 82.7MB in the beginning and 95.6MB in the end (delta: -12.9MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. * Witness Printer took 264.19ms. Allocated memory is still 272.6MB. Free memory was 95.6MB in the beginning and 85.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-10-17 16:41:48,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33455095-e302-4bfd-a084-c4d43a4fbcc3/bin/ukojak-92XMlrwhuB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE