./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 --- 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-38b53e6 [2022-11-25 17:05:26,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:05:26,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:05:26,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:05:26,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:05:26,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:05:26,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:05:26,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:05:26,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:05:26,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:05:26,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:05:26,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:05:26,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:05:26,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:05:26,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:05:26,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:05:26,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:05:26,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:05:26,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:05:26,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:05:26,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:05:26,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:05:26,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:05:26,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:05:26,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:05:26,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:05:26,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:05:26,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:05:26,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:05:26,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:05:26,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:05:26,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:05:26,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:05:26,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:05:26,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:05:26,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:05:26,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:05:26,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:05:26,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:05:26,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:05:26,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:05:26,983 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 17:05:27,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:05:27,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:05:27,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:05:27,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:05:27,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:05:27,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:05:27,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:05:27,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:05:27,009 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:05:27,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:05:27,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:05:27,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:05:27,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:05:27,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:05:27,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:05:27,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:05:27,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:05:27,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:05:27,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:05:27,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:05:27,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:05:27,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:05:27,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:05:27,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:05:27,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:05:27,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:05:27,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:05:27,015 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:05:27,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:05:27,016 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:05:27,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:05:27,016 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/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_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 [2022-11-25 17:05:27,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:05:27,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:05:27,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:05:27,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:05:27,386 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:05:27,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-25 17:05:30,402 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:05:30,604 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:05:30,605 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-25 17:05:30,612 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data/6fb48dc75/46582d83159944579560480fb3e3d284/FLAG988b17a8b [2022-11-25 17:05:30,628 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data/6fb48dc75/46582d83159944579560480fb3e3d284 [2022-11-25 17:05:30,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:05:30,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:05:30,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:05:30,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:05:30,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:05:30,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:30,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16103714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30, skipping insertion in model container [2022-11-25 17:05:30,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:30,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:05:30,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:05:30,872 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-25 17:05:30,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:05:30,907 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:05:30,919 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-25 17:05:30,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:05:30,947 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:05:30,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30 WrapperNode [2022-11-25 17:05:30,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:05:30,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:05:30,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:05:30,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:05:30,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:30,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:30,999 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-11-25 17:05:31,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:05:31,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:05:31,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:05:31,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:05:31,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,034 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:05:31,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:05:31,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:05:31,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:05:31,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (1/1) ... [2022-11-25 17:05:31,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:05:31,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:31,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:05:31,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:05:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:05:31,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:05:31,235 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:05:31,238 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:05:31,376 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:05:31,383 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:05:31,383 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:05:31,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:31 BoogieIcfgContainer [2022-11-25 17:05:31,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:05:31,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:05:31,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:05:31,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:05:31,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:05:30" (1/3) ... [2022-11-25 17:05:31,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bd5e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:05:31, skipping insertion in model container [2022-11-25 17:05:31,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:30" (2/3) ... [2022-11-25 17:05:31,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bd5e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:05:31, skipping insertion in model container [2022-11-25 17:05:31,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:31" (3/3) ... [2022-11-25 17:05:31,395 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2022-11-25 17:05:31,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:05:31,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:05:31,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:05:31,569 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a180f63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:05:31,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:05:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:05:31,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:31,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:05:31,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-11-25 17:05:31,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:31,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744994563] [2022-11-25 17:05:31,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:31,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:05:31,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:05:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:05:31,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:05:31,937 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:05:31,939 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:05:31,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:05:31,946 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-25 17:05:31,951 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:05:31,965 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:05:31,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:05:31 BoogieIcfgContainer [2022-11-25 17:05:31,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:05:31,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:05:31,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:05:31,973 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:05:31,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:31" (3/4) ... [2022-11-25 17:05:31,977 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:05:31,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:05:31,979 INFO L158 Benchmark]: Toolchain (without parser) took 1343.20ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 108.7MB in the end (delta: -3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:05:31,979 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 111.1MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:05:31,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 95.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:05:31,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.82ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:05:31,981 INFO L158 Benchmark]: Boogie Preprocessor took 36.52ms. Allocated memory is still 151.0MB. Free memory was 93.4MB in the beginning and 92.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:05:31,982 INFO L158 Benchmark]: RCFGBuilder took 347.95ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 80.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:05:31,982 INFO L158 Benchmark]: TraceAbstraction took 583.72ms. Allocated memory is still 151.0MB. Free memory was 80.0MB in the beginning and 109.5MB in the end (delta: -29.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:05:31,983 INFO L158 Benchmark]: Witness Printer took 5.37ms. Allocated memory is still 151.0MB. Free memory was 109.5MB in the beginning and 108.7MB in the end (delta: 876.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:05:31,986 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 111.1MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 95.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.82ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.52ms. Allocated memory is still 151.0MB. Free memory was 93.4MB in the beginning and 92.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.95ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 80.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 583.72ms. Allocated memory is still 151.0MB. Free memory was 80.0MB in the beginning and 109.5MB in the end (delta: -29.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.37ms. Allocated memory is still 151.0MB. Free memory was 109.5MB in the beginning and 108.7MB in the end (delta: 876.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 53, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L31] const SORT_4 var_5 = 1; [L32] const SORT_4 var_8 = 15; [L33] const SORT_1 var_12 = 1; [L35] SORT_1 input_2; [L36] SORT_1 input_3; [L38] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L40] SORT_4 init_7_arg_1 = var_5; [L41] state_6 = init_7_arg_1 VAL [init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_5=1, var_8=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:05:32,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 --- 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-38b53e6 [2022-11-25 17:05:34,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:05:34,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:05:34,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:05:34,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:05:34,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:05:34,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:05:34,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:05:34,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:05:34,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:05:34,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:05:34,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:05:34,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:05:34,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:05:34,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:05:34,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:05:34,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:05:34,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:05:34,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:05:34,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:05:34,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:05:34,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:05:34,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:05:34,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:05:34,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:05:34,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:05:34,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:05:34,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:05:34,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:05:34,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:05:34,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:05:34,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:05:34,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:05:34,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:05:34,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:05:34,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:05:34,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:05:34,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:05:34,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:05:34,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:05:34,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:05:34,629 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-25 17:05:34,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:05:34,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:05:34,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:05:34,653 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:05:34,654 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:05:34,654 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:05:34,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:05:34,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:05:34,655 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:05:34,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:05:34,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:05:34,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:05:34,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:05:34,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:05:34,656 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:05:34,657 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:05:34,657 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:05:34,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:05:34,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:05:34,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:05:34,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:05:34,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:05:34,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:05:34,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:05:34,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:05:34,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:05:34,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:05:34,659 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:05:34,659 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:05:34,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:05:34,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:05:34,660 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:05:34,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:05:34,660 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:05:34,660 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/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_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 [2022-11-25 17:05:34,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:05:35,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:05:35,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:05:35,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:05:35,020 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:05:35,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-25 17:05:38,293 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:05:38,517 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:05:38,517 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-25 17:05:38,525 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data/a98f863c1/905b8abcaf3a412dafdb2fb489a751b1/FLAG67dfaefe6 [2022-11-25 17:05:38,546 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/data/a98f863c1/905b8abcaf3a412dafdb2fb489a751b1 [2022-11-25 17:05:38,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:05:38,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:05:38,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:05:38,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:05:38,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:05:38,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3324ceac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38, skipping insertion in model container [2022-11-25 17:05:38,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:05:38,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:05:38,760 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-25 17:05:38,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:05:38,827 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:05:38,842 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-25 17:05:38,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:05:38,889 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:05:38,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38 WrapperNode [2022-11-25 17:05:38,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:05:38,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:05:38,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:05:38,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:05:38,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,934 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-11-25 17:05:38,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:05:38,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:05:38,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:05:38,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:05:38,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:05:38,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:05:38,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:05:38,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:05:38,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (1/1) ... [2022-11-25 17:05:38,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:05:39,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:39,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:05:39,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:05:39,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:05:39,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:05:39,145 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:05:39,147 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:05:39,324 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:05:39,330 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:05:39,331 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:05:39,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:39 BoogieIcfgContainer [2022-11-25 17:05:39,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:05:39,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:05:39,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:05:39,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:05:39,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:05:38" (1/3) ... [2022-11-25 17:05:39,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eccd090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:05:39, skipping insertion in model container [2022-11-25 17:05:39,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:05:38" (2/3) ... [2022-11-25 17:05:39,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eccd090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:05:39, skipping insertion in model container [2022-11-25 17:05:39,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:39" (3/3) ... [2022-11-25 17:05:39,357 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2022-11-25 17:05:39,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:05:39,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:05:39,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:05:39,501 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3562a430, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:05:39,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:05:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:05:39,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:39,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:05:39,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:39,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:39,529 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-11-25 17:05:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:05:39,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878554644] [2022-11-25 17:05:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:39,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:05:39,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:05:39,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:05:39,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:05:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:39,668 WARN L261 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 17:05:39,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:39,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-11-25 17:05:39,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:05:39,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:05:39,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878554644] [2022-11-25 17:05:39,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878554644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:05:39,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:05:39,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:05:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724329755] [2022-11-25 17:05:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:05:39,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:05:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:05:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:05:39,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:05:39,997 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:40,048 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2022-11-25 17:05:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:05:40,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:05:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:40,059 INFO L225 Difference]: With dead ends: 20 [2022-11-25 17:05:40,059 INFO L226 Difference]: Without dead ends: 11 [2022-11-25 17:05:40,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:05:40,066 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:40,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:05:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-25 17:05:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2022-11-25 17:05:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-25 17:05:40,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-11-25 17:05:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:40,102 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-25 17:05:40,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-25 17:05:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 17:05:40,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:40,103 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:40,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:40,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:05:40,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2022-11-25 17:05:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:05:40,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195012840] [2022-11-25 17:05:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:40,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:05:40,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:05:40,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:05:40,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:05:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:40,406 WARN L261 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 17:05:40,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:40,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:41,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:05:41,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195012840] [2022-11-25 17:05:41,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195012840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:05:41,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:05:41,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-25 17:05:41,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164266436] [2022-11-25 17:05:41,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:05:41,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:05:41,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:05:41,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:05:41,512 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:41,773 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-11-25 17:05:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:05:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 17:05:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:41,774 INFO L225 Difference]: With dead ends: 19 [2022-11-25 17:05:41,775 INFO L226 Difference]: Without dead ends: 17 [2022-11-25 17:05:41,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:05:41,776 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:41,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:05:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-25 17:05:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-11-25 17:05:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-25 17:05:41,783 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-25 17:05:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:41,783 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-25 17:05:41,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:05:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-25 17:05:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:05:41,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:41,784 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2022-11-25 17:05:41,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:05:41,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:05:41,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 2 times [2022-11-25 17:05:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:05:41,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718095000] [2022-11-25 17:05:41,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:05:41,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:05:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:05:41,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:05:42,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:05:42,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:05:42,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:42,074 WARN L261 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-25 17:05:42,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:05:43,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:56,868 WARN L233 SmtUtils]: Spent 12.49s on a formula simplification. DAG size of input: 161 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:06:58,625 WARN L233 SmtUtils]: Spent 58.86s on a formula simplification. DAG size of input: 306 DAG size of output: 212 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:06:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:59,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:06:59,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718095000] [2022-11-25 17:06:59,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718095000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:06:59,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:59,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-25 17:06:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978130731] [2022-11-25 17:06:59,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:59,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:06:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:06:59,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:06:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:06:59,048 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:01,095 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-25 17:07:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:07:01,096 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 17:07:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:01,096 INFO L225 Difference]: With dead ends: 31 [2022-11-25 17:07:01,097 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 17:07:01,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 75.5s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:07:01,098 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:01,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:07:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 17:07:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-25 17:07:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-25 17:07:01,109 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-11-25 17:07:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:01,109 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-25 17:07:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-25 17:07:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:07:01,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:01,111 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2022-11-25 17:07:01,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:01,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:01,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:07:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash -752690141, now seen corresponding path program 3 times [2022-11-25 17:07:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:01,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996627684] [2022-11-25 17:07:01,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:07:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:01,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:01,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:01,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:07:01,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-25 17:07:01,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:07:01,455 WARN L261 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-25 17:07:01,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:04,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:19,678 WARN L233 SmtUtils]: Spent 13.54s on a formula simplification. DAG size of input: 161 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:07:33,920 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:07:41,076 WARN L233 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 150 DAG size of output: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:08:23,085 WARN L233 SmtUtils]: Spent 34.55s on a formula simplification. DAG size of input: 315 DAG size of output: 238 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:10:04,497 WARN L233 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 472 DAG size of output: 296 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:11:18,953 WARN L233 SmtUtils]: Spent 57.90s on a formula simplification. DAG size of input: 691 DAG size of output: 397 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:11:32,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|)) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse41))))))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse47)))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 .cse3))))))))))) (.cse48 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse49 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_11| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_11|) (_ bv255 32)))))) (_ bv0 8)))) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)) (.cse20 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_11| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_11|) (_ bv254 32)))) .cse48)) (_ bv0 8)))) (.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse31)) .cse2)))) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse43))))))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse50)))))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse51)))))) (.cse19 (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_10| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_10|)))))))))))))))))))))) .cse20)) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse51 .cse3))))))))))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse3))))))))))) (.cse6 (not (= ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 (_ bv254 32)))))) (_ bv0 8)))) (.cse4 (not (= ((_ extract 7 0) (bvand .cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 (_ bv255 32)))))) (_ bv0 8))))) (let ((.cse18 (and (= .cse47 .cse1) .cse4)) (.cse11 (or (and (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse44 .cse3))))))))))))))))))))))) .cse20) .cse6)) (.cse13 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse46)) .cse2))) .cse3))))))) .cse2))) .cse1))) (.cse9 (or (not (= .cse1 .cse45)) .cse19)) (.cse17 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse3)))))))))))))))))))))))))))))))))))))))) .cse1))) (.cse10 (or (and (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse3)))))))))) .cse3))))))))))))) .cse20) .cse6)) (.cse16 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse45)))))))))))))))))) (.cse8 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse44)) .cse2))) .cse3))))))) .cse2)))))) (.cse12 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse42))))) .cse3))))))))))))) (.cse14 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 .cse3))))))) .cse2))))))))))))))))))))))) .cse3))))))))))))) (.cse15 (or (not (= .cse1 .cse42)) .cse19)) (.cse30 (= .cse1 .cse41))) (and (or (and (or .cse0 (and (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))) .cse3)))))))))))))))))))) .cse3)))))))))) .cse3))))))) .cse2)))))) .cse4) (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))) (or (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse5))))) .cse3)))))))))))))))))))) .cse3)))))))))) .cse3))))))) .cse2))))) (= .cse1 .cse5))))) .cse6) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))))))))))))) (or (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse7)))))))))) .cse3)))))))))) .cse3))))))))))))))))) .cse2))))) (= .cse1 .cse7)))) .cse6) (or (and (or .cse0 .cse8) .cse9 .cse10 .cse11 (or .cse0 .cse12) (or .cse0 .cse13) (or .cse0 .cse14) .cse15 (or .cse0 .cse16) (or .cse0 .cse17)) .cse18) (or .cse4 (and (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))))))))))))))))))))) .cse19) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))))))))))))) .cse3))))))))))))))) .cse3))))))) .cse2))) .cse1)))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))))))))))))))))))))))))))))))))) .cse2))))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))))))))))))))))))))) .cse3)))))))))) .cse3))))))))))))))))) .cse2))))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))))))))))))) .cse3))))))))))))))))) .cse2))))))))))))))))) .cse20)) (or .cse0 (and (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))))))))))))) (or (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse21)))))))))))))))))))))) .cse2))))) (= .cse1 .cse21)))) .cse4) (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))) (or (= .cse1 .cse22) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse22)))))))))))))))))))))))))))))))) .cse2))))))))) .cse6) (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))))) .cse2))))))))))) .cse4 .cse19) (or .cse0 (and (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))))) .cse2))))))))))))) .cse3))))))) .cse2)))))) .cse4) (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))) (or (= .cse1 .cse23) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse23))))))) .cse2))))))))))))) .cse3))))))) .cse2))))))))) .cse6) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))))))))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse24))))) .cse3))))))))))))))) .cse3))))))) .cse2))) .cse1)) (= .cse1 .cse24)))) .cse6) (or (and (or .cse0 (and (or .cse4 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))))) .cse2))) .cse3)))))))))))))))))))) .cse3)))))))))) .cse1)))) (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))) (or (= .cse1 .cse25) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse25))))))) .cse2))) .cse3)))))))))))))))))))) .cse3)))))))))) .cse1))))))) (or (and .cse4 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))) .cse20)) .cse6) (or (and (or .cse4 (and (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))))))))))))) .cse20) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))))))))))))) (or (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse26))))) .cse3))))))))))))))))) .cse2))))))))))))))) (= .cse1 .cse26))))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))) (or (= .cse1 .cse27) (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse27))))))))))))))) .cse3))))))))))))))))) .cse2))))))))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))) (or (= .cse1 .cse28) (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse28)))))))))))))) .cse20)) .cse6) (or .cse0 .cse6 (and (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))))))) .cse2))) .cse3))))))))))))))) .cse3)))))))))) .cse1))) .cse4) (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|)))))))))) (or (= .cse1 .cse29) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse29))))))) .cse2))) .cse3))))))))))))))) .cse3)))))))))) .cse1)))))))) (not .cse30)) (or (and (or .cse18 (and .cse11 (or (and (or .cse0 .cse13 .cse6) .cse9 (or .cse0 .cse17 .cse6) .cse10 (or .cse0 .cse16 .cse6)) (and .cse4 (= .cse1 .cse31))) (or .cse0 .cse8 .cse6) (or .cse0 .cse12 .cse6) (or .cse0 .cse14 .cse6) .cse15)) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse41 .cse3)))))))))))) (or (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse39))))))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse32))))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse40))))))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse40)) .cse2))))) (and (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse3)))))))))) .cse3)))))))))) .cse3)))))))))) .cse3)))))))))))) .cse6) (or (not (= .cse1 .cse33)) .cse19) (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse34)) .cse2)))))))))) .cse2))))) .cse6) (or (and (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse3)))))))))) .cse3))))))))))))) .cse20) .cse6) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse39 .cse3)))))))))))) (or (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse37))))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse38 .cse3))))))))))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse38))))))) (and (or (and (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse3)))))))))) .cse3))))))))))))) .cse20) .cse6) (or (not (= .cse1 .cse36)) .cse19) (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse37)))))))))))))))))))) .cse3)))))))))) .cse3)))))))))))) .cse6) (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse35))))) .cse3)))))))))))) .cse6) (or .cse0 (not (= .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse36))))))))))))))))) .cse6)))) (and (= .cse1 .cse37) .cse4))) (or .cse0 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) .cse33))))) .cse3)))))))))) .cse1)) .cse6))))) (and (= .cse39 .cse1) .cse4)))) .cse30)))))))) is different from false [2022-11-25 17:14:12,534 WARN L233 SmtUtils]: Spent 2.54m on a formula simplification. DAG size of input: 994 DAG size of output: 503 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:17:36,935 WARN L233 SmtUtils]: Spent 3.12m on a formula simplification. DAG size of input: 1293 DAG size of output: 647 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:17:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 17:17:37,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:17:37,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996627684] [2022-11-25 17:17:37,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996627684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:17:37,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:17:37,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2022-11-25 17:17:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669075196] [2022-11-25 17:17:37,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:17:37,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 17:17:37,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:17:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 17:17:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=908, Unknown=22, NotChecked=72, Total=1482 [2022-11-25 17:17:37,728 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:17:48,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:17:50,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:17:52,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:17:54,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:17:58,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:01,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:18:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:06,465 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-11-25 17:18:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:18:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 17:18:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:06,467 INFO L225 Difference]: With dead ends: 52 [2022-11-25 17:18:06,467 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 17:18:06,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 633.8s TimeCoverageRelationStatistics Valid=751, Invalid=1487, Unknown=22, NotChecked=92, Total=2352 [2022-11-25 17:18:06,469 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 110 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 40 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:06,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 32 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 98 Invalid, 6 Unknown, 12 Unchecked, 15.7s Time] [2022-11-25 17:18:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 17:18:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-11-25 17:18:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:18:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-11-25 17:18:06,490 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 26 [2022-11-25 17:18:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:06,491 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-11-25 17:18:06,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:18:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-11-25 17:18:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 17:18:06,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:06,493 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2022-11-25 17:18:06,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:06,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:18:06,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 969805001, now seen corresponding path program 4 times [2022-11-25 17:18:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:18:06,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785321642] [2022-11-25 17:18:06,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:18:06,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:18:06,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:18:06,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:18:06,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:18:06,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:18:06,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:18:06,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:18:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:18:07,177 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:18:07,178 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:18:07,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:18:07,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:07,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:18:07,397 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-11-25 17:18:07,400 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:18:07,477 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,488 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,488 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,488 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,488 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,489 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,489 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,489 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,489 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,489 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,490 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,490 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,490 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,490 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,490 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:18:07 BoogieIcfgContainer [2022-11-25 17:18:07,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:18:07,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:18:07,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:18:07,517 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:18:07,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:05:39" (3/4) ... [2022-11-25 17:18:07,520 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:18:07,542 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,555 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,555 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,555 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,555 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,555 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,556 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,556 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,556 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,556 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,556 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,556 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,557 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,557 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,557 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-25 17:18:07,659 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:18:07,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:18:07,660 INFO L158 Benchmark]: Toolchain (without parser) took 749109.40ms. Allocated memory was 77.6MB in the beginning and 172.0MB in the end (delta: 94.4MB). Free memory was 53.4MB in the beginning and 105.9MB in the end (delta: -52.5MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2022-11-25 17:18:07,660 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 77.6MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:18:07,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.87ms. Allocated memory is still 77.6MB. Free memory was 53.2MB in the beginning and 42.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 17:18:07,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.59ms. Allocated memory is still 77.6MB. Free memory was 42.2MB in the beginning and 40.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:18:07,662 INFO L158 Benchmark]: Boogie Preprocessor took 33.36ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 39.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:18:07,663 INFO L158 Benchmark]: RCFGBuilder took 378.51ms. Allocated memory is still 77.6MB. Free memory was 39.5MB in the beginning and 52.1MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 17:18:07,663 INFO L158 Benchmark]: TraceAbstraction took 748166.11ms. Allocated memory was 77.6MB in the beginning and 172.0MB in the end (delta: 94.4MB). Free memory was 51.4MB in the beginning and 117.5MB in the end (delta: -66.1MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2022-11-25 17:18:07,664 INFO L158 Benchmark]: Witness Printer took 142.37ms. Allocated memory is still 172.0MB. Free memory was 117.5MB in the beginning and 105.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:18:07,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 77.6MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.87ms. Allocated memory is still 77.6MB. Free memory was 53.2MB in the beginning and 42.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.59ms. Allocated memory is still 77.6MB. Free memory was 42.2MB in the beginning and 40.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.36ms. Allocated memory is still 77.6MB. Free memory was 40.7MB in the beginning and 39.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 378.51ms. Allocated memory is still 77.6MB. Free memory was 39.5MB in the beginning and 52.1MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 748166.11ms. Allocated memory was 77.6MB in the beginning and 172.0MB in the end (delta: 94.4MB). Free memory was 51.4MB in the beginning and 117.5MB in the end (delta: -66.1MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * Witness Printer took 142.37ms. Allocated memory is still 172.0MB. Free memory was 117.5MB in the beginning and 105.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L31] const SORT_4 var_5 = 1; [L32] const SORT_4 var_8 = 15; [L33] const SORT_1 var_12 = 1; [L35] SORT_1 input_2; [L36] SORT_1 input_3; [L38] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L40] SORT_4 init_7_arg_1 = var_5; [L41] state_6 = init_7_arg_1 VAL [init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_5=1, var_8=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=16, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=2, state_6=2, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=2, var_17_arg_0=1, var_17_arg_1=1, var_18=0, var_18_arg_0=1, var_18_arg_1=15, var_19=2, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=2, var_20=2, var_20_arg_0=1, var_20_arg_1=2, var_20_arg_2=1, var_5=1, var_8=15, var_9=1, var_9_arg_0=1, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=17, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=3, state_6=3, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=3, var_17_arg_0=2, var_17_arg_1=1, var_18=0, var_18_arg_0=2, var_18_arg_1=15, var_19=3, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=3, var_20=3, var_20_arg_0=1, var_20_arg_1=3, var_20_arg_2=2, var_5=1, var_8=15, var_9=1, var_9_arg_0=2, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=18, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=4, state_6=4, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=4, var_17_arg_0=3, var_17_arg_1=1, var_18=0, var_18_arg_0=3, var_18_arg_1=15, var_19=4, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=4, var_20=4, var_20_arg_0=1, var_20_arg_1=4, var_20_arg_2=3, var_5=1, var_8=15, var_9=1, var_9_arg_0=3, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=19, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=5, state_6=5, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=5, var_17_arg_0=4, var_17_arg_1=1, var_18=0, var_18_arg_0=4, var_18_arg_1=15, var_19=5, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=5, var_20=5, var_20_arg_0=1, var_20_arg_1=5, var_20_arg_2=4, var_5=1, var_8=15, var_9=1, var_9_arg_0=4, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=20, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=6, state_6=6, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=6, var_17_arg_0=5, var_17_arg_1=1, var_18=0, var_18_arg_0=5, var_18_arg_1=15, var_19=6, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=6, var_20=6, var_20_arg_0=1, var_20_arg_1=6, var_20_arg_2=5, var_5=1, var_8=15, var_9=1, var_9_arg_0=5, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=21, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=7, state_6=7, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=7, var_17_arg_0=6, var_17_arg_1=1, var_18=0, var_18_arg_0=6, var_18_arg_1=15, var_19=7, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=7, var_20=7, var_20_arg_0=1, var_20_arg_1=7, var_20_arg_2=6, var_5=1, var_8=15, var_9=1, var_9_arg_0=6, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=22, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=8, state_6=8, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=8, var_17_arg_0=7, var_17_arg_1=1, var_18=0, var_18_arg_0=7, var_18_arg_1=15, var_19=8, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=8, var_20=8, var_20_arg_0=1, var_20_arg_1=8, var_20_arg_2=7, var_5=1, var_8=15, var_9=1, var_9_arg_0=7, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=23, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=9, state_6=9, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=9, var_17_arg_0=8, var_17_arg_1=1, var_18=0, var_18_arg_0=8, var_18_arg_1=15, var_19=9, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=9, var_20=9, var_20_arg_0=1, var_20_arg_1=9, var_20_arg_2=8, var_5=1, var_8=15, var_9=1, var_9_arg_0=8, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=24, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=10, state_6=10, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=10, var_17_arg_0=9, var_17_arg_1=1, var_18=0, var_18_arg_0=9, var_18_arg_1=15, var_19=10, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=10, var_20=10, var_20_arg_0=1, var_20_arg_1=10, var_20_arg_2=9, var_5=1, var_8=15, var_9=1, var_9_arg_0=9, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=25, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=11, state_6=11, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=11, var_17_arg_0=10, var_17_arg_1=1, var_18=0, var_18_arg_0=10, var_18_arg_1=15, var_19=11, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=11, var_20=11, var_20_arg_0=1, var_20_arg_1=11, var_20_arg_2=10, var_5=1, var_8=15, var_9=1, var_9_arg_0=10, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=26, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=12, state_6=12, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=12, var_17_arg_0=11, var_17_arg_1=1, var_18=0, var_18_arg_0=11, var_18_arg_1=15, var_19=12, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=12, var_20=12, var_20_arg_0=1, var_20_arg_1=12, var_20_arg_2=11, var_5=1, var_8=15, var_9=1, var_9_arg_0=11, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=27, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=13, state_6=13, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=13, var_17_arg_0=12, var_17_arg_1=1, var_18=0, var_18_arg_0=12, var_18_arg_1=15, var_19=13, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=13, var_20=13, var_20_arg_0=1, var_20_arg_1=13, var_20_arg_2=12, var_5=1, var_8=15, var_9=1, var_9_arg_0=12, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=28, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=14, state_6=14, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=14, var_17_arg_0=13, var_17_arg_1=1, var_18=0, var_18_arg_0=13, var_18_arg_1=15, var_19=14, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=14, var_20=14, var_20_arg_0=1, var_20_arg_1=14, var_20_arg_2=13, var_5=1, var_8=15, var_9=1, var_9_arg_0=13, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=29, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=15, state_6=15, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=15, var_17_arg_0=14, var_17_arg_1=1, var_18=0, var_18_arg_0=14, var_18_arg_1=15, var_19=15, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=15, var_20=15, var_20_arg_0=1, var_20_arg_1=15, var_20_arg_2=14, var_5=1, var_8=15, var_9=1, var_9_arg_0=14, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 747.9s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 17 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 709.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 714.6s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 94 ConstructedInterpolants, 37 QuantifiedInterpolants, 30850 SizeOfPredicates, 319 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:18:07,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7170623-782c-4359-8bbf-f787462a835d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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