./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:29:56,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:29:56,814 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:29:56,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:29:56,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:29:56,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:29:56,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:29:56,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:29:56,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:29:56,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:29:56,848 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:29:56,848 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:29:56,849 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:29:56,849 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:29:56,850 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:29:56,850 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:29:56,851 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:29:56,851 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:29:56,852 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:29:56,852 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:29:56,853 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:29:56,854 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:29:56,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:29:56,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:29:56,855 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:29:56,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:29:56,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:29:56,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:29:56,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:29:56,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:29:56,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:29:56,858 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:29:56,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:29:56,859 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:29:56,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:29:56,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:29:56,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:29:56,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:29:56,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:29:56,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:29:56,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:29:56,861 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:29:56,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:29:56,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:29:56,861 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:29:56,861 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:29:56,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:29:56,862 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 [2023-12-02 17:29:57,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:29:57,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:29:57,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:29:57,101 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:29:57,101 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:29:57,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2023-12-02 17:29:59,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:30:00,035 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:30:00,036 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2023-12-02 17:30:00,045 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data/6412a0bec/88a9daf7884c486c879fe0add860f682/FLAG0de882acc [2023-12-02 17:30:00,057 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data/6412a0bec/88a9daf7884c486c879fe0add860f682 [2023-12-02 17:30:00,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:30:00,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:30:00,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:00,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:30:00,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:30:00,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e392c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00, skipping insertion in model container [2023-12-02 17:30:00,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,096 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:30:00,214 WARN L240 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_2b218fd3-77a0-4545-abfe-60198c247c51/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i[916,929] [2023-12-02 17:30:00,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:00,281 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:30:00,290 WARN L240 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_2b218fd3-77a0-4545-abfe-60198c247c51/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i[916,929] [2023-12-02 17:30:00,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:00,331 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:30:00,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00 WrapperNode [2023-12-02 17:30:00,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:00,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:00,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:30:00,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:30:00,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,388 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2023-12-02 17:30:00,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:00,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:30:00,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:30:00,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:30:00,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:30:00,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:30:00,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:30:00,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:30:00,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (1/1) ... [2023-12-02 17:30:00,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:00,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:00,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:30:00,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:30:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:30:00,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 17:30:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:30:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-12-02 17:30:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:30:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 17:30:00,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 17:30:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 17:30:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:30:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:30:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:30:00,638 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:30:00,641 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:30:01,104 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:30:01,648 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:30:01,648 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:30:01,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:01 BoogieIcfgContainer [2023-12-02 17:30:01,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:30:01,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:30:01,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:30:01,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:30:01,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:30:00" (1/3) ... [2023-12-02 17:30:01,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f152bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:01, skipping insertion in model container [2023-12-02 17:30:01,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:00" (2/3) ... [2023-12-02 17:30:01,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f152bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:01, skipping insertion in model container [2023-12-02 17:30:01,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:01" (3/3) ... [2023-12-02 17:30:01,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-83.i [2023-12-02 17:30:01,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:30:01,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:30:01,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:30:01,732 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2b2fab7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:30:01,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 17:30:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 17:30:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 17:30:01,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:01,746 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:01,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:01,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -453505077, now seen corresponding path program 1 times [2023-12-02 17:30:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:01,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582133137] [2023-12-02 17:30:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:01,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:01,969 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 17:30:01,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494996038] [2023-12-02 17:30:01,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:01,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:01,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:01,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:01,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:30:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 17:30:02,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 17:30:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 17:30:03,603 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 17:30:03,605 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 17:30:03,607 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 17:30:03,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:30:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 17:30:03,813 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 17:30:03,816 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 17:30:03,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-12-02 17:30:03,892 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-12-02 17:30:03,893 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-12-02 17:30:03,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-12-02 17:30:03,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-12-02 17:30:03,898 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-12-02 17:30:03,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-12-02 17:30:03,901 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-12-02 17:30:03,903 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-12-02 17:30:03,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-12-02 17:30:03,906 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-12-02 17:30:03,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-12-02 17:30:03,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-12-02 17:30:03,910 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-12-02 17:30:03,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-12-02 17:30:03,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-12-02 17:30:03,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short64 could not be translated [2023-12-02 17:30:03,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated [2023-12-02 17:30:03,912 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-12-02 17:30:03,912 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-12-02 17:30:03,912 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated [2023-12-02 17:30:03,913 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-12-02 17:30:03,913 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated [2023-12-02 17:30:03,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short64 could not be translated [2023-12-02 17:30:03,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated [2023-12-02 17:30:03,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-12-02 17:30:03,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-12-02 17:30:03,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-12-02 17:30:03,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-12-02 17:30:03,916 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated [2023-12-02 17:30:03,916 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-12-02 17:30:03,916 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-12-02 17:30:03,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-12-02 17:30:03,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-12-02 17:30:03,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-12-02 17:30:03,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-12-02 17:30:03,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated [2023-12-02 17:30:03,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-12-02 17:30:03,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-12-02 17:30:03,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-12-02 17:30:03,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-12-02 17:30:03,920 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-12-02 17:30:03,920 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-12-02 17:30:03,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-12-02 17:30:03,922 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-12-02 17:30:03,923 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-12-02 17:30:03,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:30:03 BoogieIcfgContainer [2023-12-02 17:30:03,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 17:30:03,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 17:30:03,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 17:30:03,946 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 17:30:03,946 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:01" (3/4) ... [2023-12-02 17:30:03,948 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 17:30:03,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 17:30:03,950 INFO L158 Benchmark]: Toolchain (without parser) took 3889.01ms. Allocated memory was 190.8MB in the beginning and 245.4MB in the end (delta: 54.5MB). Free memory was 149.7MB in the beginning and 196.5MB in the end (delta: -46.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2023-12-02 17:30:03,951 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:30:03,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.58ms. Allocated memory is still 190.8MB. Free memory was 149.2MB in the beginning and 135.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 17:30:03,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.65ms. Allocated memory is still 190.8MB. Free memory was 135.2MB in the beginning and 131.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 17:30:03,953 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 190.8MB. Free memory was 131.0MB in the beginning and 128.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 17:30:03,953 INFO L158 Benchmark]: RCFGBuilder took 1214.95ms. Allocated memory is still 190.8MB. Free memory was 128.3MB in the beginning and 134.5MB in the end (delta: -6.1MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2023-12-02 17:30:03,954 INFO L158 Benchmark]: TraceAbstraction took 2292.47ms. Allocated memory was 190.8MB in the beginning and 245.4MB in the end (delta: 54.5MB). Free memory was 133.4MB in the beginning and 196.5MB in the end (delta: -63.0MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2023-12-02 17:30:03,954 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 245.4MB. Free memory is still 196.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:30:03,958 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.58ms. Allocated memory is still 190.8MB. Free memory was 149.2MB in the beginning and 135.2MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.65ms. Allocated memory is still 190.8MB. Free memory was 135.2MB in the beginning and 131.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 190.8MB. Free memory was 131.0MB in the beginning and 128.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1214.95ms. Allocated memory is still 190.8MB. Free memory was 128.3MB in the beginning and 134.5MB in the end (delta: -6.1MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2292.47ms. Allocated memory was 190.8MB in the beginning and 245.4MB in the end (delta: 54.5MB). Free memory was 133.4MB in the beginning and 196.5MB in the end (delta: -63.0MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 245.4MB. Free memory is still 196.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 64, overapproximation of someUnaryDOUBLEoperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 25; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_4 = 4; [L29] unsigned char* var_1_4_Pointer = &(var_1_4); [L30] double var_1_8 = 127.625; [L31] double* var_1_8_Pointer = &(var_1_8); [L32] double var_1_10 = 0.8; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 128.75; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] double var_1_12 = 24.8; [L37] double* var_1_12_Pointer = &(var_1_12); [L38] signed short int var_1_14 = -128; [L39] signed short int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = 64; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] signed char var_1_16 = 5; [L43] signed char* var_1_16_Pointer = &(var_1_16); [L44] double var_1_17 = 1.5; [L45] double* var_1_17_Pointer = &(var_1_17); [L46] unsigned short int last_1_var_1_1 = 128; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR \read(var_1_1) [L98] last_1_var_1_1 = var_1_1 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L82] var_1_3 = __VERIFIER_nondet_ushort() [L83] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L85] var_1_4 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] var_1_10 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_10) [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L90] EXPR \read(var_1_10) [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L90] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L91] var_1_11 = __VERIFIER_nondet_double() [L92] EXPR \read(var_1_11) [L92] EXPR var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F [L92] EXPR (var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) [L92] EXPR \read(var_1_11) [L92] EXPR var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F [L92] EXPR \read(var_1_11) [L92] EXPR var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F [L92] EXPR (var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L93] var_1_16 = __VERIFIER_nondet_char() [L94] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L109] RET updateVariables() [L110] CALL step() [L50] (*(var_1_14_Pointer)) = 200 [L51] EXPR \read(*var_1_16_Pointer) [L51] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L52] EXPR \read(*var_1_10_Pointer) [L52] (*(var_1_17_Pointer)) = (*(var_1_10_Pointer)) [L53] EXPR \read(*var_1_3_Pointer) [L53] EXPR \read(*var_1_4_Pointer) [L53] signed long int stepLocal_0 = (*(var_1_3_Pointer)) / (*(var_1_4_Pointer)); [L54] EXPR \read(*var_1_2_Pointer) [L54] COND TRUE (*(var_1_2_Pointer)) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L55] EXPR ((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L55] EXPR ((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) [L55] (*(var_1_1_Pointer)) = ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))) [L63] EXPR \read(*var_1_3_Pointer) [L63] EXPR \read(*var_1_1_Pointer) [L63] signed long int stepLocal_2 = (*(var_1_3_Pointer)) + (*(var_1_1_Pointer)); [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR \read(*var_1_15_Pointer) [L64] EXPR (*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)) [L64] signed long int stepLocal_1 = (*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)); [L65] EXPR \read(*var_1_15_Pointer) [L65] COND TRUE (*(var_1_15_Pointer)) <= stepLocal_2 [L66] EXPR \read(*var_1_1_Pointer) [L66] COND FALSE !((*(var_1_1_Pointer)) == stepLocal_1) [L69] EXPR \read(*var_1_11_Pointer) [L69] (*(var_1_8_Pointer)) = (*(var_1_11_Pointer)) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR \read(*var_1_15_Pointer) [L74] COND FALSE !((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))) [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L101] EXPR ((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR (((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))) [L101] EXPR ((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))) [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) [L101] EXPR \read(*var_1_15_Pointer) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR ((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))) [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR \read(*var_1_14_Pointer) [L101] EXPR \read(*var_1_15_Pointer) [L101] EXPR (*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)) [L101] EXPR ((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L101] EXPR \read(*var_1_8_Pointer) [L101] EXPR \read(*var_1_10_Pointer) [L101] EXPR (((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L101] EXPR \read(*var_1_10_Pointer) [L101] EXPR (((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR ((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L101] EXPR ((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))) [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200)) [L101] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) [L101] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) [L101-L102] return ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 1, TraceHistogramMax: 11, 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=31occurred 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 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 [2023-12-02 17:30:03,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:30:05,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:30:05,936 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 17:30:05,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:30:05,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:30:05,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:30:05,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:30:05,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:30:05,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:30:05,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:30:05,973 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:30:05,973 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:30:05,974 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:30:05,974 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:30:05,975 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:30:05,975 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:30:05,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:30:05,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:30:05,977 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:30:05,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:30:05,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:30:05,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:30:05,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:30:05,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:30:05,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:30:05,980 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:30:05,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:30:05,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:30:05,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:30:05,982 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:30:05,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:30:05,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:30:05,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:30:05,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:30:05,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:05,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:30:05,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:30:05,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:30:05,985 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:30:05,985 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:30:05,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:30:05,986 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:30:05,986 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:30:05,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:30:05,986 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 [2023-12-02 17:30:06,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:30:06,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:30:06,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:30:06,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:30:06,309 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:30:06,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2023-12-02 17:30:09,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:30:09,324 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:30:09,325 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2023-12-02 17:30:09,334 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data/cb66aae60/e573e8bc13744b09b81f93425a12d4fb/FLAGc49d6219c [2023-12-02 17:30:09,349 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/data/cb66aae60/e573e8bc13744b09b81f93425a12d4fb [2023-12-02 17:30:09,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:30:09,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:30:09,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:09,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:30:09,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:30:09,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b525ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09, skipping insertion in model container [2023-12-02 17:30:09,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,394 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:30:09,546 WARN L240 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_2b218fd3-77a0-4545-abfe-60198c247c51/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i[916,929] [2023-12-02 17:30:09,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:09,620 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:30:09,633 WARN L240 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_2b218fd3-77a0-4545-abfe-60198c247c51/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i[916,929] [2023-12-02 17:30:09,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:09,684 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:30:09,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09 WrapperNode [2023-12-02 17:30:09,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:09,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:09,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:30:09,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:30:09,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,744 INFO L138 Inliner]: procedures = 33, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 459 [2023-12-02 17:30:09,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:09,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:30:09,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:30:09,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:30:09,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:30:09,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:30:09,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:30:09,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:30:09,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (1/1) ... [2023-12-02 17:30:09,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:09,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:30:09,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:30:09,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:30:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-12-02 17:30:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-12-02 17:30:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 17:30:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-12-02 17:30:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:30:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-12-02 17:30:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-12-02 17:30:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 17:30:09,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 17:30:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:30:09,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:30:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-12-02 17:30:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-12-02 17:30:10,020 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:30:10,022 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:30:11,079 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:30:11,147 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:30:11,147 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 17:30:11,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:11 BoogieIcfgContainer [2023-12-02 17:30:11,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:30:11,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:30:11,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:30:11,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:30:11,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:30:09" (1/3) ... [2023-12-02 17:30:11,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ad9550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:11, skipping insertion in model container [2023-12-02 17:30:11,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:09" (2/3) ... [2023-12-02 17:30:11,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ad9550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:11, skipping insertion in model container [2023-12-02 17:30:11,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:11" (3/3) ... [2023-12-02 17:30:11,156 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-83.i [2023-12-02 17:30:11,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:30:11,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:30:11,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:30:11,218 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7b7c8816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:30:11,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 17:30:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 17:30:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:11,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:11,234 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:11,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:11,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1004924382, now seen corresponding path program 1 times [2023-12-02 17:30:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:11,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036935294] [2023-12-02 17:30:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:11,252 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 [2023-12-02 17:30:11,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:11,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:11,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:11,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 17:30:11,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-02 17:30:11,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:30:11,692 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036935294] [2023-12-02 17:30:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036935294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:11,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:30:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984248630] [2023-12-02 17:30:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:11,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 17:30:11,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 17:30:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 17:30:11,750 INFO L87 Difference]: Start difference. First operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:11,862 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2023-12-02 17:30:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 17:30:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:11,872 INFO L225 Difference]: With dead ends: 189 [2023-12-02 17:30:11,872 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 17:30:11,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 17:30:11,878 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:11,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:30:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 17:30:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-02 17:30:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 17:30:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2023-12-02 17:30:11,917 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 99 [2023-12-02 17:30:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:11,918 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2023-12-02 17:30:11,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2023-12-02 17:30:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:11,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:11,924 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:11,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:12,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:12,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:12,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1329431472, now seen corresponding path program 1 times [2023-12-02 17:30:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767764427] [2023-12-02 17:30:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:12,130 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 [2023-12-02 17:30:12,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:12,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:12,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:12,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:30:12,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:30:12,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:30:12,568 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:12,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767764427] [2023-12-02 17:30:12,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767764427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:12,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:12,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:30:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769128330] [2023-12-02 17:30:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:12,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:30:12,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:12,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:30:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:30:12,572 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:12,846 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2023-12-02 17:30:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:30:12,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:12,850 INFO L225 Difference]: With dead ends: 208 [2023-12-02 17:30:12,850 INFO L226 Difference]: Without dead ends: 115 [2023-12-02 17:30:12,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:30:12,853 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 46 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:12,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 494 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:30:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-02 17:30:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2023-12-02 17:30:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 17:30:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2023-12-02 17:30:12,866 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 99 [2023-12-02 17:30:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:12,868 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2023-12-02 17:30:12,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2023-12-02 17:30:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:12,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:12,871 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:12,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 17:30:13,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:13,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:13,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash 520084846, now seen corresponding path program 1 times [2023-12-02 17:30:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384660739] [2023-12-02 17:30:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:13,078 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 [2023-12-02 17:30:13,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:13,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:13,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:13,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 17:30:13,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:30:13,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:30:13,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384660739] [2023-12-02 17:30:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384660739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:13,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:30:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951438557] [2023-12-02 17:30:13,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:13,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:30:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:13,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:30:13,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:30:13,541 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:13,797 INFO L93 Difference]: Finished difference Result 215 states and 300 transitions. [2023-12-02 17:30:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 17:30:13,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:13,801 INFO L225 Difference]: With dead ends: 215 [2023-12-02 17:30:13,801 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 17:30:13,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:30:13,803 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 49 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:13,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 611 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:30:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 17:30:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2023-12-02 17:30:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 17:30:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2023-12-02 17:30:13,815 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 99 [2023-12-02 17:30:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:13,816 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2023-12-02 17:30:13,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2023-12-02 17:30:13,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:13,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:13,819 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:13,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:14,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:14,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:14,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash 577343148, now seen corresponding path program 1 times [2023-12-02 17:30:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:14,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722289714] [2023-12-02 17:30:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:14,026 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 [2023-12-02 17:30:14,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:14,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:14,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:14,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 17:30:14,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:14,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 17:30:15,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-02 17:30:15,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:15,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 52 [2023-12-02 17:30:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:30:15,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:30:15,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722289714] [2023-12-02 17:30:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722289714] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:15,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:30:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948555453] [2023-12-02 17:30:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:15,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:30:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:30:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:30:15,592 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:19,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 17:30:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:19,472 INFO L93 Difference]: Finished difference Result 305 states and 426 transitions. [2023-12-02 17:30:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:30:19,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:19,475 INFO L225 Difference]: With dead ends: 305 [2023-12-02 17:30:19,475 INFO L226 Difference]: Without dead ends: 206 [2023-12-02 17:30:19,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-02 17:30:19,477 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 102 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:19,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 435 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2023-12-02 17:30:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-02 17:30:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 142. [2023-12-02 17:30:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 17:30:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2023-12-02 17:30:19,498 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 99 [2023-12-02 17:30:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:19,499 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2023-12-02 17:30:19,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2023-12-02 17:30:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:19,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:19,501 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:19,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:19,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:19,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:19,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:19,703 INFO L85 PathProgramCache]: Analyzing trace with hash 443329642, now seen corresponding path program 1 times [2023-12-02 17:30:19,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:19,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143861705] [2023-12-02 17:30:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:19,704 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 [2023-12-02 17:30:19,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:19,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:19,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:20,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 17:30:20,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:20,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 17:30:21,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:21,304 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2023-12-02 17:30:21,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-12-02 17:30:21,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 17:30:21,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-12-02 17:30:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:30:21,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:30:21,473 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143861705] [2023-12-02 17:30:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143861705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:30:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709859517] [2023-12-02 17:30:21,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:21,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:30:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:21,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:30:21,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:30:21,476 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:24,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:30:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:26,301 INFO L93 Difference]: Finished difference Result 377 states and 521 transitions. [2023-12-02 17:30:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:30:26,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:26,303 INFO L225 Difference]: With dead ends: 377 [2023-12-02 17:30:26,303 INFO L226 Difference]: Without dead ends: 278 [2023-12-02 17:30:26,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-02 17:30:26,305 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 259 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:26,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 394 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 437 Invalid, 4 Unknown, 0 Unchecked, 4.6s Time] [2023-12-02 17:30:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-12-02 17:30:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 157. [2023-12-02 17:30:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.3333333333333333) internal successors, (176), 132 states have internal predecessors, (176), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 17:30:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 220 transitions. [2023-12-02 17:30:26,323 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 220 transitions. Word has length 99 [2023-12-02 17:30:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:26,323 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 220 transitions. [2023-12-02 17:30:26,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 220 transitions. [2023-12-02 17:30:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:26,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:26,325 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:26,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 17:30:26,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:26,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:26,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -577738712, now seen corresponding path program 1 times [2023-12-02 17:30:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509052647] [2023-12-02 17:30:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:26,527 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 [2023-12-02 17:30:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:26,528 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:26,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (7)] Waiting until timeout for monitored process [2023-12-02 17:30:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:26,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 17:30:26,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:28,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:28,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:28,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:29,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:29,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-12-02 17:30:29,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 17:30:29,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 17:30:29,588 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2023-12-02 17:30:29,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 45 [2023-12-02 17:30:29,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-12-02 17:30:29,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2023-12-02 17:30:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 17:30:29,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:29,968 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem31#1| (_ BitVec 8))) (bvsle ((_ sign_extend 24) |ULTIMATE.start_step_#t~mem31#1|) |c_ULTIMATE.start_step_~stepLocal_2~0#1|)) (forall ((v_ArrVal_170 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_170))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))))) is different from false [2023-12-02 17:30:29,990 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_step_#t~mem31#1| (_ BitVec 8)) (~var_1_3_Pointer~0.offset (_ BitVec 32)) (~var_1_3_Pointer~0.base (_ BitVec 32))) (bvsle ((_ sign_extend 24) |ULTIMATE.start_step_#t~mem31#1|) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| ~var_1_3_Pointer~0.base) ~var_1_3_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)))))) (forall ((v_ArrVal_170 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_170))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))))) is different from false [2023-12-02 17:30:30,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem31#1| (_ BitVec 8)) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_170 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_3_Pointer~0.offset (_ BitVec 32)) (~var_1_3_Pointer~0.base (_ BitVec 32)) (v_ArrVal_166 (_ BitVec 32))) (let ((.cse3 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base (store (select |c_#memory_int| c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset v_ArrVal_166)) c_~var_1_15_Pointer~0.base v_ArrVal_164) c_~var_1_17_Pointer~0.base v_ArrVal_167))) (let ((.cse2 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse3 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))) (let ((.cse1 (store .cse3 c_~var_1_1_Pointer~0.base (store (select .cse3 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset .cse2)))) (or (let ((.cse0 (store .cse1 c_~var_1_8_Pointer~0.base v_ArrVal_170))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))) (bvsle ((_ sign_extend 24) |ULTIMATE.start_step_#t~mem31#1|) (bvadd ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 ~var_1_3_Pointer~0.base) ~var_1_3_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) .cse2))))))))) is different from false [2023-12-02 17:30:30,934 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:30,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509052647] [2023-12-02 17:30:30,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509052647] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:30,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1588406620] [2023-12-02 17:30:30,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:30,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:30:30,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:30:30,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:30:30,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-02 17:30:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:32,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:30:32,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:33,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-02 17:30:34,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 17:30:34,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 17:30:35,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 17:30:35,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2023-12-02 17:30:35,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-02 17:30:35,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-12-02 17:30:35,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2023-12-02 17:30:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 17:30:35,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:36,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))))) c_~var_1_8_Pointer~0.base v_ArrVal_206))) (= ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))) is different from false [2023-12-02 17:30:36,133 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_203 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (let ((.cse1 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_203) c_~var_1_15_Pointer~0.base v_ArrVal_202) c_~var_1_17_Pointer~0.base v_ArrVal_201))) (store .cse1 c_~var_1_1_Pointer~0.base (store (select .cse1 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))))))) c_~var_1_8_Pointer~0.base v_ArrVal_206))) (= ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))) is different from false [2023-12-02 17:30:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1588406620] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:36,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282744666] [2023-12-02 17:30:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:36,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:36,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:36,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:36,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 17:30:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:36,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 17:30:36,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:37,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-12-02 17:30:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-02 17:30:37,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2023-12-02 17:30:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-02 17:30:37,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:37,277 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_235))) (= ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) c_~var_1_1_Pointer~0.offset)))))) is different from false [2023-12-02 17:30:37,341 INFO L349 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2023-12-02 17:30:37,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 52 [2023-12-02 17:30:37,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:37,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 102 [2023-12-02 17:30:37,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:37,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 76 [2023-12-02 17:30:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:30:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282744666] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:37,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:30:37,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 12, 9] total 30 [2023-12-02 17:30:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652642789] [2023-12-02 17:30:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:30:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:30:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=743, Unknown=34, NotChecked=378, Total=1332 [2023-12-02 17:30:37,793 INFO L87 Difference]: Start difference. First operand 157 states and 220 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:39,822 INFO L93 Difference]: Finished difference Result 344 states and 478 transitions. [2023-12-02 17:30:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:30:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:39,826 INFO L225 Difference]: With dead ends: 344 [2023-12-02 17:30:39,826 INFO L226 Difference]: Without dead ends: 245 [2023-12-02 17:30:39,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=232, Invalid=1090, Unknown=34, NotChecked=450, Total=1806 [2023-12-02 17:30:39,828 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 348 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:39,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 392 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 228 Unchecked, 1.7s Time] [2023-12-02 17:30:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-02 17:30:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 180. [2023-12-02 17:30:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 155 states have internal predecessors, (209), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 17:30:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 253 transitions. [2023-12-02 17:30:39,845 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 253 transitions. Word has length 99 [2023-12-02 17:30:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:39,845 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 253 transitions. [2023-12-02 17:30:39,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 253 transitions. [2023-12-02 17:30:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:39,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:39,847 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:39,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (7)] Forceful destruction successful, exit code 0 [2023-12-02 17:30:40,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-02 17:30:40,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 17:30:40,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:40,448 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:40,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1857602390, now seen corresponding path program 1 times [2023-12-02 17:30:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:40,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355019071] [2023-12-02 17:30:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:40,449 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 [2023-12-02 17:30:40,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:40,450 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:40,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (10)] Waiting until timeout for monitored process [2023-12-02 17:30:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:40,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 17:30:40,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:42,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:43,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:43,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:43,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:44,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-12-02 17:30:44,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2023-12-02 17:30:44,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:44,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:44,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 17:30:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-02 17:30:44,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:30:44,909 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355019071] [2023-12-02 17:30:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355019071] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:30:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 17 [2023-12-02 17:30:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794541155] [2023-12-02 17:30:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:44,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:30:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:30:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:30:44,912 INFO L87 Difference]: Start difference. First operand 180 states and 253 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:45,296 INFO L93 Difference]: Finished difference Result 326 states and 457 transitions. [2023-12-02 17:30:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:30:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:45,305 INFO L225 Difference]: With dead ends: 326 [2023-12-02 17:30:45,305 INFO L226 Difference]: Without dead ends: 213 [2023-12-02 17:30:45,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-12-02 17:30:45,306 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 32 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:45,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:30:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-02 17:30:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 182. [2023-12-02 17:30:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 157 states have internal predecessors, (211), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 17:30:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2023-12-02 17:30:45,316 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 99 [2023-12-02 17:30:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:45,316 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2023-12-02 17:30:45,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2023-12-02 17:30:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 17:30:45,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:45,318 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:45,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (10)] Ended with exit code 0 [2023-12-02 17:30:45,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:45,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:45,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1911790250, now seen corresponding path program 1 times [2023-12-02 17:30:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117769808] [2023-12-02 17:30:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:45,520 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 [2023-12-02 17:30:45,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:45,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:45,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (11)] Waiting until timeout for monitored process [2023-12-02 17:30:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:45,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 17:30:45,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:46,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:47,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:47,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:47,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:48,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2023-12-02 17:30:48,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:48,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 107 [2023-12-02 17:30:48,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2023-12-02 17:30:48,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2023-12-02 17:30:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-02 17:30:51,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:30:52,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:30:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117769808] [2023-12-02 17:30:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117769808] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:30:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2023-12-02 17:30:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573939502] [2023-12-02 17:30:52,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:52,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:30:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:30:52,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:30:52,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:30:52,409 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:52,740 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2023-12-02 17:30:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:30:52,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-02 17:30:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:52,742 INFO L225 Difference]: With dead ends: 305 [2023-12-02 17:30:52,742 INFO L226 Difference]: Without dead ends: 183 [2023-12-02 17:30:52,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:30:52,743 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 27 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:52,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 351 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:30:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-02 17:30:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-12-02 17:30:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 158 states have (on average 1.3354430379746836) internal successors, (211), 158 states have internal predecessors, (211), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 17:30:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 255 transitions. [2023-12-02 17:30:52,754 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 255 transitions. Word has length 99 [2023-12-02 17:30:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:52,755 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 255 transitions. [2023-12-02 17:30:52,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:30:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 255 transitions. [2023-12-02 17:30:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-02 17:30:52,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:52,756 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:52,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (11)] Ended with exit code 0 [2023-12-02 17:30:52,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 17:30:52,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:30:52,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:52,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1314253526, now seen corresponding path program 1 times [2023-12-02 17:30:52,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:30:52,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762183227] [2023-12-02 17:30:52,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:52,958 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 [2023-12-02 17:30:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:30:52,959 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:30:52,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (12)] Waiting until timeout for monitored process [2023-12-02 17:30:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:53,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 17:30:53,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:53,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 17:30:55,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:30:56,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:56,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:56,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:30:57,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-12-02 17:30:57,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-12-02 17:30:57,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2023-12-02 17:30:57,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2023-12-02 17:30:58,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2023-12-02 17:30:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-02 17:30:58,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:01,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem92#1| (_ BitVec 16)) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_341))) (bvsge (bvsdiv ((_ zero_extend 16) |ULTIMATE.start_property_#t~mem92#1|) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) (bvmul ((_ zero_extend 16) c_~last_1_var_1_1~0) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_15_Pointer~0.base) c_~var_1_15_Pointer~0.offset))))))) is different from false [2023-12-02 17:31:02,063 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_property_#t~mem92#1| (_ BitVec 16)) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_340) c_~var_1_8_Pointer~0.base v_ArrVal_341))) (bvsge (bvsdiv ((_ zero_extend 16) |ULTIMATE.start_property_#t~mem92#1|) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) (bvmul ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_15_Pointer~0.base) c_~var_1_15_Pointer~0.offset))) ((_ zero_extend 16) c_~last_1_var_1_1~0))))) is different from false [2023-12-02 17:31:02,274 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 16) c_~last_1_var_1_1~0))) (or (forall ((|ULTIMATE.start_property_#t~mem92#1| (_ BitVec 16)) (v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_340) c_~var_1_8_Pointer~0.base v_ArrVal_341))) (bvsge (bvsdiv ((_ zero_extend 16) |ULTIMATE.start_property_#t~mem92#1|) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset)))) (bvmul ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_15_Pointer~0.base) c_~var_1_15_Pointer~0.offset))) .cse1)))) (not (bvslt (bvmul ((_ sign_extend 24) |c_ULTIMATE.start_step_#t~mem22#1|) .cse1) (bvnot .cse1))))) is different from false [2023-12-02 17:31:09,274 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:31:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762183227] [2023-12-02 17:31:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762183227] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [960296408] [2023-12-02 17:31:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:31:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:31:09,275 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:31:09,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-02 17:31:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:10,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:31:10,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:10,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 17:31:13,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-12-02 17:31:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-02 17:31:14,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:31:14,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [960296408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:14,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:31:14,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2023-12-02 17:31:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436392268] [2023-12-02 17:31:14,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:14,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:31:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:31:14,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:31:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=635, Unknown=4, NotChecked=162, Total=930 [2023-12-02 17:31:14,366 INFO L87 Difference]: Start difference. First operand 183 states and 255 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:31:20,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 17:31:22,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:31:24,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 17:31:27,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 17:31:29,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 17:31:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:29,954 INFO L93 Difference]: Finished difference Result 422 states and 584 transitions. [2023-12-02 17:31:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:31:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2023-12-02 17:31:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:29,957 INFO L225 Difference]: With dead ends: 422 [2023-12-02 17:31:29,957 INFO L226 Difference]: Without dead ends: 306 [2023-12-02 17:31:29,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=139, Invalid=739, Unknown=4, NotChecked=174, Total=1056 [2023-12-02 17:31:29,958 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 152 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:29,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 456 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 5 Unknown, 0 Unchecked, 14.7s Time] [2023-12-02 17:31:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-12-02 17:31:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 201. [2023-12-02 17:31:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.3636363636363635) internal successors, (240), 176 states have internal predecessors, (240), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-02 17:31:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 284 transitions. [2023-12-02 17:31:29,978 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 284 transitions. Word has length 100 [2023-12-02 17:31:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:29,978 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 284 transitions. [2023-12-02 17:31:29,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-02 17:31:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 284 transitions. [2023-12-02 17:31:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-02 17:31:29,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:29,980 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:29,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (12)] Ended with exit code 0 [2023-12-02 17:31:30,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-12-02 17:31:30,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:31:30,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 17:31:30,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1834863598, now seen corresponding path program 1 times [2023-12-02 17:31:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:31:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402769513] [2023-12-02 17:31:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:30,382 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 [2023-12-02 17:31:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:31:30,382 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 17:31:30,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b218fd3-77a0-4545-abfe-60198c247c51/bin/utaipan-verify-nQ1chXbOIh/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 (14)] Waiting until timeout for monitored process [2023-12-02 17:31:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:30,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 17:31:30,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:31,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 17:31:36,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:31:41,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:31:43,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:31:44,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-12-02 17:31:47,445 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-12-02 17:31:47,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 98 [2023-12-02 17:31:48,154 INFO L349 Elim1Store]: treesize reduction 58, result has 23.7 percent of original size [2023-12-02 17:31:48,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 125 [2023-12-02 17:31:49,026 INFO L349 Elim1Store]: treesize reduction 68, result has 23.6 percent of original size [2023-12-02 17:31:49,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 140 [2023-12-02 17:31:49,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 17:31:51,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 102 [2023-12-02 17:31:51,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-12-02 17:31:51,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-12-02 17:31:54,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:55,790 INFO L349 Elim1Store]: treesize reduction 140, result has 24.3 percent of original size [2023-12-02 17:31:55,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 182 [2023-12-02 17:31:58,138 INFO L224 Elim1Store]: Index analysis took 124 ms [2023-12-02 17:31:58,548 INFO L349 Elim1Store]: treesize reduction 66, result has 10.8 percent of original size [2023-12-02 17:31:58,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 34 [2023-12-02 17:32:02,438 INFO L224 Elim1Store]: Index analysis took 162 ms [2023-12-02 17:32:03,111 INFO L349 Elim1Store]: treesize reduction 89, result has 18.3 percent of original size [2023-12-02 17:32:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 30 [2023-12-02 17:32:04,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:32:04,520 INFO L224 Elim1Store]: Index analysis took 186 ms [2023-12-02 17:32:04,998 INFO L349 Elim1Store]: treesize reduction 85, result has 8.6 percent of original size [2023-12-02 17:32:04,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 19 [2023-12-02 17:32:05,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:32:05,898 INFO L224 Elim1Store]: Index analysis took 185 ms [2023-12-02 17:32:06,358 INFO L349 Elim1Store]: treesize reduction 101, result has 7.3 percent of original size [2023-12-02 17:32:06,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 33 [2023-12-02 17:32:07,163 INFO L224 Elim1Store]: Index analysis took 115 ms [2023-12-02 17:32:07,555 INFO L349 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2023-12-02 17:32:07,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 121 treesize of output 109 [2023-12-02 17:32:44,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 17:32:46,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:32:47,366 INFO L349 Elim1Store]: treesize reduction 138, result has 25.4 percent of original size [2023-12-02 17:32:47,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 184 [2023-12-02 17:32:47,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:32:47,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:32:47,687 INFO L224 Elim1Store]: Index analysis took 191 ms [2023-12-02 17:32:47,717 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:32:47,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2023-12-02 17:32:49,330 INFO L224 Elim1Store]: Index analysis took 208 ms [2023-12-02 17:32:50,055 INFO L349 Elim1Store]: treesize reduction 122, result has 12.2 percent of original size [2023-12-02 17:32:50,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 35 [2023-12-02 17:32:54,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 17:32:54,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 17:32:54,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 17:32:55,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:32:55,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2023-12-02 17:32:56,002 INFO L349 Elim1Store]: treesize reduction 26, result has 54.4 percent of original size [2023-12-02 17:32:56,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 65 [2023-12-02 17:33:00,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 17:33:05,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 191 [2023-12-02 17:33:13,490 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 136 DAG size of output: 40 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 17:33:13,490 INFO L349 Elim1Store]: treesize reduction 264, result has 20.7 percent of original size [2023-12-02 17:33:13,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 252 treesize of output 259 [2023-12-02 17:33:23,365 INFO L349 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2023-12-02 17:33:23,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2023-12-02 17:33:38,509 INFO L349 Elim1Store]: treesize reduction 55, result has 32.9 percent of original size [2023-12-02 17:33:38,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2023-12-02 17:33:42,608 INFO L349 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2023-12-02 17:33:42,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2023-12-02 17:33:44,376 INFO L349 Elim1Store]: treesize reduction 55, result has 32.9 percent of original size [2023-12-02 17:33:44,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2023-12-02 17:34:50,847 INFO L349 Elim1Store]: treesize reduction 55, result has 32.9 percent of original size [2023-12-02 17:34:50,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2023-12-02 17:34:51,678 INFO L349 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2023-12-02 17:34:51,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2023-12-02 17:34:52,879 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2023-12-02 17:34:52,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2023-12-02 17:34:55,578 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2023-12-02 17:34:55,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2023-12-02 17:34:58,659 INFO L349 Elim1Store]: treesize reduction 55, result has 32.9 percent of original size [2023-12-02 17:34:58,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2023-12-02 17:35:00,408 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2023-12-02 17:35:00,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2023-12-02 17:35:05,649 INFO L349 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2023-12-02 17:35:05,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2023-12-02 17:35:07,847 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2023-12-02 17:35:07,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2023-12-02 17:35:17,148 INFO L349 Elim1Store]: treesize reduction 55, result has 32.9 percent of original size [2023-12-02 17:35:17,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 71 [2023-12-02 17:35:27,603 INFO L349 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2023-12-02 17:35:27,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2023-12-02 17:35:46,931 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2023-12-02 17:35:46,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2023-12-02 17:36:03,608 INFO L349 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2023-12-02 17:36:03,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2023-12-02 17:36:17,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 92 [2023-12-02 17:36:17,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 83 [2023-12-02 17:36:18,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2023-12-02 17:36:20,514 INFO L349 Elim1Store]: treesize reduction 116, result has 23.2 percent of original size [2023-12-02 17:36:20,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 145 treesize of output 154 [2023-12-02 17:36:23,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 6 [2023-12-02 17:36:23,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 6 [2023-12-02 17:36:26,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 6 [2023-12-02 17:36:27,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2023-12-02 17:36:27,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 6 [2023-12-02 17:36:27,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 292 [2023-12-02 17:36:27,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 491 [2023-12-02 17:36:37,680 INFO L224 Elim1Store]: Index analysis took 150 ms [2023-12-02 17:36:37,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-12-02 17:36:38,096 INFO L224 Elim1Store]: Index analysis took 161 ms [2023-12-02 17:36:38,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-12-02 17:36:38,560 INFO L224 Elim1Store]: Index analysis took 152 ms [2023-12-02 17:36:38,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-12-02 17:36:39,196 INFO L224 Elim1Store]: Index analysis took 173 ms [2023-12-02 17:36:39,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-12-02 17:36:39,998 INFO L224 Elim1Store]: Index analysis took 181 ms [2023-12-02 17:36:40,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-12-02 17:36:49,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-12-02 17:36:50,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 5 [2023-12-02 17:36:50,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-12-02 17:36:50,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-12-02 17:36:52,372 INFO L349 Elim1Store]: treesize reduction 116, result has 23.2 percent of original size [2023-12-02 17:36:52,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 147 treesize of output 152 [2023-12-02 17:36:55,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 6 [2023-12-02 17:36:55,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 6 [2023-12-02 17:36:58,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 6 [2023-12-02 17:37:00,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2606 treesize of output 2159 [2023-12-02 17:37:49,449 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~var_1_15_Pointer~0.base (_ bv13 32)) (= ((_ extract 15 0) ((_ sign_extend 16) (_ bv128 16))) c_~last_1_var_1_1~0) (let ((.cse3 ((_ sign_extend 16) (_ bv200 16))) (.cse9 (select |c_#memory_int| (_ bv13 32))) (.cse2 (select |c_#memory_int| (_ bv12 32)))) (let ((.cse20 (select .cse2 c_~var_1_15_Pointer~0.offset)) (.cse4 (select .cse9 c_~var_1_15_Pointer~0.offset)) (.cse11 ((_ sign_extend 24) ((_ extract 7 0) .cse3)))) (let ((.cse6 (store .cse9 c_~var_1_15_Pointer~0.offset .cse11)) (.cse1 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (and (= .cse3 (select .cse2 ~var_1_14_Pointer~0.offset)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_7))) .cse4) (not (= ~var_1_14_Pointer~0.offset v_prenex_7))))) (.cse0 (exists ((~var_1_4_Pointer~0.offset (_ BitVec 32)) (~var_1_3_Pointer~0.offset (_ BitVec 32)) (~var_1_3_Pointer~0.base (_ BitVec 32))) (let ((.cse148 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| (_ bv7 32)) ~var_1_4_Pointer~0.offset))))) (and (not (= (_ bv0 32) .cse148)) (= (bvsdiv ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| ~var_1_3_Pointer~0.base) ~var_1_3_Pointer~0.offset))) .cse148) |c_ULTIMATE.start_step_~stepLocal_0~0#1|))))) (.cse58 (exists ((~var_1_16_Pointer~0.offset (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset ~var_1_16_Pointer~0.offset)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_16_Pointer~0.offset))) .cse4)))) (.cse57 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (= .cse3 (select .cse2 ~var_1_14_Pointer~0.offset)))) (.cse23 (= .cse4 .cse11)) (.cse41 (= .cse20 .cse3))) (or (and .cse0 (or .cse1 (and (exists ((v_prenex_1315 (_ BitVec 32))) (= (select .cse2 v_prenex_1315) .cse3)) (exists ((v_arrayElimCell_118 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_118)) .cse4))) (and (exists ((v_prenex_1313 (_ BitVec 32))) (= (select .cse2 v_prenex_1313) .cse3)) (exists ((v_prenex_1312 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1312)) .cse4))) (and (exists ((v_prenex_1306 (_ BitVec 32))) (= (select .cse2 v_prenex_1306) .cse3)) (exists ((~var_1_16_Pointer~0.offset (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 ~var_1_16_Pointer~0.offset))) .cse4))) (exists ((v_prenex_1311 (_ BitVec 32)) (v_prenex_1310 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_1311))) .cse4) (not (= v_prenex_1310 v_prenex_1311)) (= (select .cse2 v_prenex_1310) .cse3))) (and (or (exists ((v_prenex_1305 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_1305))) .cse4)) (exists ((v_prenex_1309 (_ BitVec 32)) (v_prenex_1308 (_ BitVec 32))) (let ((.cse5 (select .cse2 v_prenex_1309))) (and (= ((_ sign_extend 24) ((_ extract 7 0) .cse5)) .cse4) (= .cse5 (select .cse2 v_prenex_1308)))))) (exists ((v_prenex_1307 (_ BitVec 32))) (= (select .cse2 v_prenex_1307) .cse3))))) (and .cse0 (let ((.cse14 ((_ sign_extend 24) ((_ extract 7 0) .cse20)))) (let ((.cse15 (= .cse14 .cse4))) (or (exists ((v_prenex_1471 (_ BitVec 32)) (v_prenex_1470 (_ BitVec 32)) (v_DerPreprocessor_65 (_ BitVec 32)) (v_prenex_1469 (_ BitVec 32)) (v_prenex_1468 (_ BitVec 32))) (let ((.cse8 (select .cse2 v_prenex_1469)) (.cse7 (store (store .cse2 v_prenex_1468 v_DerPreprocessor_65) c_~var_1_15_Pointer~0.offset .cse11)) (.cse10 (select .cse2 v_prenex_1471))) (and (= .cse6 .cse7) (= (select (store (store .cse2 v_prenex_1468 v_prenex_1470) c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) .cse8))) v_prenex_1468) v_prenex_1470) (= (select .cse2 v_prenex_1468) .cse3) (= (select .cse9 v_prenex_1469) .cse8) (not (= v_prenex_1469 v_prenex_1471)) (= (select .cse7 v_prenex_1468) v_DerPreprocessor_65) (= ((_ sign_extend 24) ((_ extract 7 0) .cse10)) .cse4) (= (select .cse9 v_prenex_1471) .cse10)))) (and (exists ((v_prenex_1509 (_ BitVec 32))) (let ((.cse12 (select .cse2 v_prenex_1509))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1509)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse12)) .cse4) (= (select .cse9 v_prenex_1509) .cse12)))) (exists ((v_DerPreprocessor_63 (_ BitVec 32)) (v_prenex_1459 (_ BitVec 32)) (v_prenex_1458 (_ BitVec 32))) (let ((.cse13 (store (store .cse2 v_prenex_1458 v_DerPreprocessor_63) c_~var_1_15_Pointer~0.offset .cse11))) (and (= .cse13 .cse6) (= (select .cse13 v_prenex_1458) v_DerPreprocessor_63) (= (select .cse2 v_prenex_1458) .cse3) (= v_prenex_1459 (select (store (store .cse2 v_prenex_1458 v_prenex_1459) c_~var_1_15_Pointer~0.offset .cse14) v_prenex_1458)))))) (and .cse15 (exists ((v_DerPreprocessor_94 (_ BitVec 32)) (v_prenex_1435 (_ BitVec 32)) (v_prenex_1434 (_ BitVec 32))) (let ((.cse16 (store (store .cse2 v_prenex_1434 v_DerPreprocessor_94) c_~var_1_15_Pointer~0.offset .cse11))) (and (= (select .cse16 v_prenex_1434) v_DerPreprocessor_94) (= (select (store (store .cse2 v_prenex_1434 v_prenex_1435) c_~var_1_15_Pointer~0.offset .cse14) v_prenex_1434) v_prenex_1435) (= .cse16 .cse6) (= (select .cse2 v_prenex_1434) .cse3))))) (exists ((v_prenex_1473 (_ BitVec 32)) (v_prenex_1474 (_ BitVec 32))) (and (not (= v_prenex_1474 v_prenex_1473)) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1473)) (= (select .cse2 v_prenex_1473) .cse3) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_1474))) .cse4))) (and (exists ((v_prenex_1418 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1418)) (= (select .cse2 v_prenex_1418) .cse3))) (exists ((v_prenex_1419 (_ BitVec 32))) (let ((.cse17 (select .cse9 v_prenex_1419))) (and (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) .cse17))) (= .cse17 .cse3))))) (and .cse15 (exists ((v_prenex_1508 (_ BitVec 32)) (v_prenex_1507 (_ BitVec 32)) (v_DerPreprocessor_67 (_ BitVec 32)) (v_prenex_1510 (_ BitVec 32))) (let ((.cse18 (store (store .cse2 v_prenex_1510 v_DerPreprocessor_67) c_~var_1_15_Pointer~0.offset .cse11)) (.cse19 (select .cse2 v_prenex_1507))) (and (= .cse6 .cse18) (= (select .cse18 v_prenex_1510) v_DerPreprocessor_67) (= (select (store (store .cse2 v_prenex_1510 v_prenex_1508) c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) .cse19))) v_prenex_1510) v_prenex_1508) (= (select .cse2 v_prenex_1510) .cse3) (= .cse19 (select .cse9 v_prenex_1507)) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1507)))))) (and .cse15 (exists ((v_prenex_1432 (_ BitVec 32))) (and (= (store (store .cse2 v_prenex_1432 (select .cse6 v_prenex_1432)) c_~var_1_15_Pointer~0.offset .cse11) .cse6) (= (select .cse2 v_prenex_1432) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1432)))) (exists ((v_prenex_1433 (_ BitVec 32))) (and (= .cse20 (select .cse2 v_prenex_1433)) (= .cse20 (select .cse9 v_prenex_1433))))) (exists ((v_prenex_1484 (_ BitVec 32)) (v_prenex_1486 (_ BitVec 32)) (v_prenex_1485 (_ BitVec 32))) (let ((.cse21 ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1485)))) (and (= v_prenex_1485 (select (store .cse9 c_~var_1_15_Pointer~0.offset .cse21) v_prenex_1486)) (not (= v_prenex_1486 v_prenex_1484)) (= .cse21 .cse4) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1484)) (= .cse3 (select .cse2 v_prenex_1484))))) (and (exists ((v_prenex_1409 (_ BitVec 32)) (v_prenex_1408 (_ BitVec 32))) (let ((.cse22 (select .cse9 v_prenex_1409))) (and (= .cse22 .cse3) (= .cse22 (select .cse9 v_prenex_1408)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse22)) .cse4)))) (exists ((v_prenex_1407 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1407)) (= (select .cse2 v_prenex_1407) .cse3)))) (and .cse23 (exists ((v_prenex_1467 (_ BitVec 32))) (= (select .cse2 v_prenex_1467) .cse3))) (exists ((v_prenex_1396 (_ BitVec 32)) (v_prenex_1397 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1397))) .cse4) (not (= v_prenex_1397 v_prenex_1396)) (= (select .cse2 v_prenex_1396) .cse3))) (exists ((v_prenex_1421 (_ BitVec 32)) (v_prenex_1420 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1420) .cse3) (not (= v_prenex_1420 v_prenex_1421)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1421))) .cse4) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1420)))) (and (exists ((v_prenex_1431 (_ BitVec 32)) (v_prenex_1430 (_ BitVec 32))) (let ((.cse24 (select .cse2 v_prenex_1430))) (and (= (select .cse2 v_prenex_1431) .cse24) (= (select .cse9 v_prenex_1431) .cse24) (= .cse24 (select .cse9 v_prenex_1430)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse24)) .cse4)))) (exists ((v_DerPreprocessor_86 (_ BitVec 32)) (v_prenex_1429 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1429) .cse3) (= (store (store .cse2 v_prenex_1429 v_DerPreprocessor_86) c_~var_1_15_Pointer~0.offset .cse11) .cse6) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1429))))) (and .cse15 (exists ((v_DerPreprocessor_97 (_ BitVec 32)) (v_prenex_1428 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1428) .cse3) (= (store (store .cse2 v_prenex_1428 v_DerPreprocessor_97) c_~var_1_15_Pointer~0.offset .cse11) .cse6) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1428))))) (exists ((v_prenex_1483 (_ BitVec 32)) (v_prenex_1482 (_ BitVec 32)) (v_prenex_1481 (_ BitVec 32))) (let ((.cse25 (select .cse6 v_prenex_1482))) (let ((.cse26 ((_ sign_extend 24) ((_ extract 7 0) .cse25)))) (and (= .cse25 .cse3) (= (select .cse2 v_prenex_1481) .cse3) (= (select (store .cse9 c_~var_1_15_Pointer~0.offset .cse26) v_prenex_1483) .cse25) (not (= v_prenex_1481 v_prenex_1482)) (= .cse26 .cse4))))) (and (exists ((v_prenex_1446 (_ BitVec 32))) (= (select .cse6 v_prenex_1446) .cse3)) (exists ((v_prenex_1445 (_ BitVec 32)) (v_prenex_1444 (_ BitVec 32))) (and (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_1445)))) (not (= v_prenex_1444 v_prenex_1445)) (= .cse3 (select .cse2 v_prenex_1444))))) (and .cse23 (exists ((v_prenex_1436 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1436)) (= (select .cse2 v_prenex_1436) .cse3)))) (exists ((v_prenex_1480 (_ BitVec 32)) (v_prenex_1479 (_ BitVec 32))) (let ((.cse27 (select .cse6 v_prenex_1480))) (and (= .cse27 .cse3) (= (select .cse2 v_prenex_1479) .cse3) (= ((_ sign_extend 24) ((_ extract 7 0) .cse27)) .cse4) (not (= v_prenex_1479 v_prenex_1480))))) (and (exists ((v_arrayElimCell_92 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_92)))) (exists ((v_prenex_1410 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1410) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1410))))) (exists ((v_prenex_1455 (_ BitVec 32)) (v_prenex_1454 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1454) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1455)) (not (= v_prenex_1454 v_prenex_1455)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_1455))) .cse4))) (and .cse15 (exists ((v_prenex_1405 (_ BitVec 32))) (and (= .cse20 (select .cse2 v_prenex_1405)) (= .cse20 (select .cse9 v_prenex_1405)))) (exists ((v_prenex_1406 (_ BitVec 32)) (v_prenex_1404 (_ BitVec 32))) (and (= (select (store (store .cse2 v_prenex_1404 v_prenex_1406) c_~var_1_15_Pointer~0.offset .cse14) v_prenex_1404) v_prenex_1406) (= .cse6 (store (store .cse2 v_prenex_1404 (select .cse6 v_prenex_1404)) c_~var_1_15_Pointer~0.offset .cse11)) (= (select .cse2 v_prenex_1404) .cse3)))) (exists ((v_DerPreprocessor_102 (_ BitVec 32)) (v_prenex_1403 (_ BitVec 32)) (v_prenex_1402 (_ BitVec 32)) (v_prenex_1401 (_ BitVec 32)) (v_prenex_1400 (_ BitVec 32))) (let ((.cse29 (select .cse2 v_prenex_1401))) (let ((.cse28 (store (store .cse2 v_prenex_1400 v_DerPreprocessor_102) c_~var_1_15_Pointer~0.offset .cse11)) (.cse30 ((_ sign_extend 24) ((_ extract 7 0) .cse29)))) (and (= v_DerPreprocessor_102 (select .cse28 v_prenex_1400)) (= (select .cse9 v_prenex_1403) .cse29) (= (select .cse2 v_prenex_1403) .cse29) (= .cse29 (select .cse9 v_prenex_1401)) (= .cse6 .cse28) (= (select (store (store .cse2 v_prenex_1400 v_prenex_1402) c_~var_1_15_Pointer~0.offset .cse30) v_prenex_1400) v_prenex_1402) (= .cse3 (select .cse2 v_prenex_1400)) (= .cse30 .cse4))))) (and .cse15 (exists ((v_prenex_1490 (_ BitVec 32)) (v_prenex_1489 (_ BitVec 32))) (and (= .cse20 (select .cse2 v_prenex_1490)) (= (select .cse2 v_prenex_1489) .cse3) (= .cse6 (store (store .cse2 v_prenex_1489 (select .cse6 v_prenex_1489)) c_~var_1_15_Pointer~0.offset .cse11)) (not (= v_prenex_1489 v_prenex_1490))))) (and (exists ((v_prenex_1514 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1514)))) (exists ((v_prenex_1478 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1478) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1478))))) (and (exists ((v_prenex_1413 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1413)) (= (select .cse2 v_prenex_1413) .cse3))) (exists ((v_prenex_1414 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1414))) .cse4))) (exists ((v_prenex_1466 (_ BitVec 32)) (v_prenex_1465 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1466))) .cse4) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1465)) (= (select .cse2 v_prenex_1465) .cse3) (not (= v_prenex_1465 v_prenex_1466)))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse31 (select .cse9 ~var_1_16_Pointer~0.offset))) (and (= .cse3 (select .cse2 ~var_1_14_Pointer~0.offset)) (= .cse31 (select .cse9 v_prenex_19)) (not (= ~var_1_14_Pointer~0.offset c_~var_1_15_Pointer~0.offset)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse31)) .cse4) (not (= ~var_1_14_Pointer~0.offset ~var_1_16_Pointer~0.offset))))) (and (exists ((v_prenex_1506 (_ BitVec 32)) (v_prenex_1505 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1506)) (= (select (store .cse9 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1505))) v_prenex_1506) v_prenex_1505) (= (select .cse2 v_prenex_1506) .cse3))) (exists ((v_prenex_1504 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1504)) .cse4))) (and .cse23 (exists ((v_prenex_1491 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1491) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1491))))) (exists ((v_prenex_1424 (_ BitVec 32)) (v_prenex_1423 (_ BitVec 32)) (v_prenex_1422 (_ BitVec 32))) (let ((.cse32 (select .cse9 v_prenex_1424))) (and (= (select .cse2 v_prenex_1422) .cse3) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) .cse32))) (not (= v_prenex_1422 v_prenex_1424)) (= (select .cse9 v_prenex_1423) .cse32)))) (exists ((v_prenex_1492 (_ BitVec 32)) (v_prenex_1441 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1441) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1441)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_1492))) .cse4) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1492)) (not (= v_prenex_1441 v_prenex_1492)))) (and .cse23 (exists ((v_prenex_1425 (_ BitVec 32))) (= (select .cse2 v_prenex_1425) .cse3))) (exists ((v_prenex_1461 (_ BitVec 32)) (v_prenex_1460 (_ BitVec 32))) (and (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1461)))) (= (select .cse2 v_prenex_1460) .cse3) (not (= v_prenex_1460 v_prenex_1461)))) (and (exists ((v_prenex_1394 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1394) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1394)))) (exists ((v_prenex_1395 (_ BitVec 32))) (let ((.cse33 (select .cse9 v_prenex_1395))) (and (= .cse33 .cse3) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) .cse33))))))) (and (exists ((v_prenex_1437 (_ BitVec 32))) (= (select .cse2 v_prenex_1437) .cse3)) (exists ((v_prenex_1438 (_ BitVec 32))) (let ((.cse34 (select .cse9 v_prenex_1438))) (and (= .cse34 .cse3) (= ((_ sign_extend 24) ((_ extract 7 0) .cse34)) .cse4))))) (exists ((v_prenex_1450 (_ BitVec 32)) (v_prenex_1449 (_ BitVec 32)) (v_prenex_1448 (_ BitVec 32)) (v_prenex_1447 (_ BitVec 32))) (and (not (= v_prenex_1447 v_prenex_1448)) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_1448)))) (not (= v_prenex_1448 v_prenex_1450)) (not (= v_prenex_1447 v_prenex_1450)) (= (select .cse2 v_prenex_1447) .cse3) (= (select (store .cse9 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1449))) v_prenex_1450) v_prenex_1449))) (and (exists ((v_prenex_1462 (_ BitVec 32)) (v_DerPreprocessor_72 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1462)) (= (store (store .cse2 v_prenex_1462 v_DerPreprocessor_72) c_~var_1_15_Pointer~0.offset .cse11) .cse6) (= (select .cse2 v_prenex_1462) .cse3))) (or (and .cse15 (exists ((v_prenex_1463 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1463)) (= (select .cse9 v_prenex_1463) (select .cse2 v_prenex_1463))))) (exists ((v_prenex_1457 (_ BitVec 32))) (let ((.cse35 (select .cse2 v_prenex_1457))) (and (= .cse35 (select .cse9 v_prenex_1457)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse35)) .cse4) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1457))))) (exists ((v_prenex_1456 (_ BitVec 32)) (v_prenex_1464 (_ BitVec 32))) (let ((.cse36 (select .cse2 v_prenex_1464))) (and (= (select .cse2 v_prenex_1456) (select .cse9 v_prenex_1456)) (not (= v_prenex_1464 v_prenex_1456)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse36)) .cse4) (= .cse36 (select .cse9 v_prenex_1464))))))) (and (exists ((v_prenex_1417 (_ BitVec 32)) (v_prenex_1416 (_ BitVec 32))) (let ((.cse37 (select .cse9 v_prenex_1417))) (and (= .cse37 .cse3) (= ((_ sign_extend 24) ((_ extract 7 0) .cse37)) .cse4) (= (select .cse9 v_prenex_1416) .cse37)))) (exists ((v_prenex_1415 (_ BitVec 32))) (= (select .cse2 v_prenex_1415) .cse3))) (and (or (and (exists ((v_prenex_1439 (_ BitVec 32))) (and (not (= c_~var_1_15_Pointer~0.offset v_prenex_1439)) (= (select .cse2 v_prenex_1439) .cse3))) (exists ((v_prenex_1440 (_ BitVec 32))) (= (select .cse6 v_prenex_1440) .cse3))) (exists ((v_prenex_1495 (_ BitVec 32)) (v_prenex_1494 (_ BitVec 32)) (v_prenex_1493 (_ BitVec 32))) (and (= (select (store .cse9 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1495))) v_prenex_1493) v_prenex_1495) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1493)) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1494)) (= (select .cse2 v_prenex_1494) .cse3) (not (= v_prenex_1493 v_prenex_1494))))) (exists ((v_arrayElimCell_93 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_93))))) (exists ((v_prenex_1503 (_ BitVec 32)) (v_prenex_1502 (_ BitVec 32))) (and (not (= v_prenex_1502 v_prenex_1503)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1503))) .cse4) (= (select .cse2 v_prenex_1502) .cse3))) (and .cse23 (exists ((v_prenex_1487 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1487) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1487)))) (exists ((v_prenex_1488 (_ BitVec 32))) (= (select .cse6 v_prenex_1488) .cse3))) (exists ((v_prenex_1496 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1496) .cse3) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1496))) .cse4))) (exists ((v_prenex_1500 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1500))) .cse4) (= (select .cse2 v_prenex_1500) .cse3))) (exists ((v_prenex_1477 (_ BitVec 32)) (v_prenex_1476 (_ BitVec 32)) (v_prenex_1475 (_ BitVec 32))) (let ((.cse39 (select .cse6 v_prenex_1476))) (let ((.cse38 ((_ sign_extend 24) ((_ extract 7 0) .cse39)))) (and (= .cse38 .cse4) (not (= v_prenex_1475 v_prenex_1476)) (= (select .cse2 v_prenex_1475) .cse3) (= (select (store .cse9 c_~var_1_15_Pointer~0.offset .cse38) v_prenex_1477) .cse39) (not (= v_prenex_1475 v_prenex_1477)))))) (and (exists ((v_prenex_1411 (_ BitVec 32))) (= (select .cse2 v_prenex_1411) .cse3)) (exists ((v_prenex_1412 (_ BitVec 32))) (let ((.cse40 (select .cse9 v_prenex_1412))) (and (= ((_ sign_extend 24) ((_ extract 7 0) .cse40)) .cse4) (= .cse40 .cse3))))) (and .cse41 (exists ((v_prenex_1501 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1501)) .cse4))) (exists ((v_prenex_1513 (_ BitVec 32)) (v_DerPreprocessor_58 (_ BitVec 32)) (v_prenex_1512 (_ BitVec 32)) (v_prenex_1511 (_ BitVec 32))) (let ((.cse43 (select .cse2 v_prenex_1511))) (let ((.cse42 ((_ sign_extend 24) ((_ extract 7 0) .cse43))) (.cse44 (store (store .cse2 v_prenex_1513 v_DerPreprocessor_58) c_~var_1_15_Pointer~0.offset .cse11))) (and (= (select (store .cse9 c_~var_1_15_Pointer~0.offset .cse42) v_prenex_1512) .cse43) (= .cse43 (select .cse2 v_prenex_1512)) (= .cse42 .cse4) (= .cse44 .cse6) (not (= v_prenex_1511 v_prenex_1513)) (= (select .cse44 v_prenex_1513) v_DerPreprocessor_58) (= (select .cse2 v_prenex_1513) .cse3))))) (and (exists ((v_DerPreprocessor_83 (_ BitVec 32)) (v_prenex_1398 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse45 (store (store .cse2 v_prenex_1398 v_DerPreprocessor_83) c_~var_1_15_Pointer~0.offset .cse11))) (and (= (select .cse45 v_prenex_1398) v_DerPreprocessor_83) (= (select .cse2 v_prenex_1398) .cse3) (= v_DerPreprocessor_8 (select (store (store .cse2 v_prenex_1398 v_DerPreprocessor_8) c_~var_1_15_Pointer~0.offset .cse14) v_prenex_1398)) (= .cse6 .cse45)))) .cse15 (exists ((v_prenex_1399 (_ BitVec 32))) (and (= .cse20 (select .cse2 v_prenex_1399)) (= .cse20 (select .cse9 v_prenex_1399))))) (and (exists ((v_prenex_1427 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1427) .cse20) (= .cse20 (select .cse9 v_prenex_1427)))) .cse15 (exists ((v_DerPreprocessor_106 (_ BitVec 32)) (v_prenex_1426 (_ BitVec 32))) (and (= .cse6 (store (store .cse2 v_prenex_1426 v_DerPreprocessor_106) c_~var_1_15_Pointer~0.offset .cse11)) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1426)) (= (select .cse2 v_prenex_1426) .cse3)))) (exists ((v_DerPreprocessor_77 (_ BitVec 32)) (v_prenex_1443 (_ BitVec 32)) (v_prenex_1442 (_ BitVec 32))) (let ((.cse46 (store (store .cse2 v_prenex_1442 v_DerPreprocessor_77) c_~var_1_15_Pointer~0.offset .cse11))) (and (not (= v_prenex_1442 v_prenex_1443)) (= .cse6 .cse46) (= (select .cse2 v_prenex_1442) .cse3) (= (select .cse46 v_prenex_1442) v_DerPreprocessor_77) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1443)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_1443))) .cse4)))) (exists ((v_prenex_1499 (_ BitVec 32)) (v_prenex_1498 (_ BitVec 32)) (v_prenex_1497 (_ BitVec 32))) (and (= (select (store .cse9 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) v_prenex_1498))) v_prenex_1499) v_prenex_1498) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_1497))) .cse4) (= .cse3 (select .cse2 v_prenex_1499)) (not (= v_prenex_1497 v_prenex_1499)))) (exists ((v_prenex_1451 (_ BitVec 32)) (v_DerPreprocessor_80 (_ BitVec 32)) (v_prenex_1453 (_ BitVec 32)) (v_prenex_1452 (_ BitVec 32))) (let ((.cse47 (store (store .cse2 v_prenex_1451 v_DerPreprocessor_80) c_~var_1_15_Pointer~0.offset .cse11))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_1452))) .cse4) (= .cse47 .cse6) (= (select .cse47 v_prenex_1451) v_DerPreprocessor_80) (= (select .cse2 v_prenex_1451) .cse3) (not (= v_prenex_1452 v_prenex_1451)) (let ((.cse48 (select .cse2 v_prenex_1453))) (= (select (store .cse9 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) .cse48))) v_prenex_1453) .cse48)) (not (= v_prenex_1452 v_prenex_1453))))) (and .cse23 (exists ((v_prenex_1472 (_ BitVec 32))) (and (= (select .cse2 v_prenex_1472) .cse3) (not (= c_~var_1_15_Pointer~0.offset v_prenex_1472))))))))) (and (let ((.cse50 (exists ((v_prenex_1348 (_ BitVec 32))) (and (not (= (_ bv13 32) v_prenex_1348)) (exists ((v_prenex_1347 (_ BitVec 32)) (v_prenex_1346 (_ BitVec 32))) (let ((.cse56 (select |c_#memory_int| v_prenex_1348))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse56 v_prenex_1347))) .cse4) (not (= v_prenex_1346 v_prenex_1347)) (= .cse2 (store .cse56 v_prenex_1346 .cse3)))))))) (.cse49 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_16_Pointer~0.base (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse55 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse55 ~var_1_16_Pointer~0.offset))) .cse4) (= (store .cse55 ~var_1_14_Pointer~0.offset .cse3) .cse2)))))) (or (and .cse23 .cse49) (and .cse23 (or .cse50 .cse49)) (and .cse23 (or (and (exists ((v_prenex_1348 (_ BitVec 32))) (= (select |c_#memory_int| v_prenex_1348) .cse9)) .cse49) (and (exists ((v_prenex_1348 (_ BitVec 32))) (and (not (= (_ bv13 32) v_prenex_1348)) (= (select |c_#memory_int| v_prenex_1348) .cse9))) (exists ((v_prenex_1347 (_ BitVec 32)) (v_prenex_1346 (_ BitVec 32))) (and (= .cse2 (store .cse9 v_prenex_1346 .cse3)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_1347))) .cse4) (not (= v_prenex_1346 v_prenex_1347))))))) .cse50 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (v_prenex_1348 (_ BitVec 32)) (~var_1_16_Pointer~0.base (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse51 (select |c_#memory_int| v_prenex_1348)) (.cse52 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (= (select .cse51 c_~var_1_15_Pointer~0.offset) .cse11) (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse52 ~var_1_16_Pointer~0.offset))) .cse4) (= (store .cse52 ~var_1_14_Pointer~0.offset .cse3) .cse2) (let ((.cse53 ((_ sign_extend 24) ((_ extract 7 0) (select .cse52 v_prenex_7))))) (= (store .cse9 c_~var_1_15_Pointer~0.offset .cse53) (store .cse51 c_~var_1_15_Pointer~0.offset .cse53)))))) (exists ((v_prenex_1348 (_ BitVec 32)) (v_prenex_1347 (_ BitVec 32)) (v_prenex_1346 (_ BitVec 32))) (let ((.cse54 (select |c_#memory_int| v_prenex_1348))) (and (= (select .cse54 c_~var_1_15_Pointer~0.offset) .cse11) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse54 v_prenex_1347))) .cse4) (not (= v_prenex_1346 v_prenex_1347)) (= (store .cse54 c_~var_1_15_Pointer~0.offset .cse4) .cse9) (not (= (_ bv13 32) v_prenex_1348)) (= .cse2 (store .cse54 v_prenex_1346 .cse3))))) .cse49)) .cse0) (and .cse23 .cse57 .cse0) (and (or (exists ((v_prenex_237 (_ BitVec 32)) (v_prenex_236 (_ BitVec 32))) (and (= (select .cse2 v_prenex_236) .cse3) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_237))) .cse4) (not (= v_prenex_236 v_prenex_237)))) (and .cse57 (or .cse58 (exists ((v_arrayElimCell_109 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_109)) .cse4)))) (and (exists ((v_prenex_234 (_ BitVec 32))) (and (= (select .cse2 v_prenex_234) .cse3) (not (= v_prenex_234 c_~var_1_15_Pointer~0.offset)))) (exists ((v_prenex_235 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) v_prenex_235))))) (and (or (exists ((v_arrayElimCell_108 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_108)))) (exists ((v_prenex_233 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_233))))) (exists ((v_prenex_46 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 v_prenex_46)))))) (exists ((v_prenex_232 (_ BitVec 32))) (= .cse3 (select .cse2 v_prenex_232))))) .cse0) (and (let ((.cse60 (exists ((v_prenex_1273 (_ BitVec 32))) (= (select .cse2 v_prenex_1273) .cse3)))) (let ((.cse59 (and (exists ((v_prenex_1275 (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (and (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| v_prenex_1275) ~var_1_16_Pointer~0.offset)))) (not (= v_prenex_1275 (_ bv12 32))) (not (= (_ bv13 32) v_prenex_1275)))) .cse60)) (.cse62 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (~var_1_16_Pointer~0.base (_ BitVec 32))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= .cse3 (select .cse2 ~var_1_14_Pointer~0.offset)) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| ~var_1_16_Pointer~0.base) v_prenex_7))) .cse4) (not (= ~var_1_14_Pointer~0.offset v_prenex_7)))))) (or .cse59 (and .cse60 (exists ((v_prenex_1275 (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse61 (select |c_#memory_int| v_prenex_1275))) (and (= .cse61 .cse9) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse61 ~var_1_16_Pointer~0.offset)))) (not (= v_prenex_1275 (_ bv12 32))) (not (= (_ bv13 32) v_prenex_1275)) (= (select .cse61 c_~var_1_15_Pointer~0.offset) .cse11))))) (and .cse23 (or .cse59 .cse62)) (and .cse60 (exists ((v_prenex_1275 (_ BitVec 32)) (v_prenex_1274 (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse63 (select |c_#memory_int| v_prenex_1275))) (and (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse63 ~var_1_16_Pointer~0.offset)))) (not (= v_prenex_1275 (_ bv12 32))) (not (= (_ bv13 32) v_prenex_1275)) (= (select .cse63 c_~var_1_15_Pointer~0.offset) .cse11) (let ((.cse64 ((_ sign_extend 24) ((_ extract 7 0) (select .cse63 v_prenex_1274))))) (= (store .cse9 c_~var_1_15_Pointer~0.offset .cse64) (store .cse63 c_~var_1_15_Pointer~0.offset .cse64))))))) (and (exists ((v_prenex_1275 (_ BitVec 32))) (let ((.cse65 (select |c_#memory_int| v_prenex_1275))) (and (= .cse65 .cse9) (= (select .cse65 c_~var_1_15_Pointer~0.offset) .cse11)))) .cse62) .cse62 (and .cse23 .cse62) (and (exists ((v_prenex_1275 (_ BitVec 32))) (let ((.cse66 (select |c_#memory_int| v_prenex_1275))) (and (= (store .cse66 c_~var_1_15_Pointer~0.offset .cse4) .cse9) (= (select .cse66 c_~var_1_15_Pointer~0.offset) .cse11)))) .cse62)))) .cse0) (and .cse1 .cse0) (and (or (and (exists ((v_prenex_1272 (_ BitVec 32))) (= (select .cse2 v_prenex_1272) .cse3)) (exists ((v_arrayElimCell_116 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_116)) .cse4))) (and .cse57 (exists ((v_arrayElimCell_115 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_115)))))) .cse0) (and .cse0 (let ((.cse87 (store .cse9 c_~var_1_15_Pointer~0.offset .cse20)) (.cse71 (store .cse2 c_~var_1_15_Pointer~0.offset .cse11))) (let ((.cse73 (= .cse9 .cse71)) (.cse79 (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32))) (let ((.cse147 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (= (store .cse147 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (not (= v_prenex_239 (_ bv13 32))) (= .cse2 (store .cse147 v_prenex_238 .cse3)) (= (store .cse147 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse147 v_prenex_240)))) .cse9))))) (.cse100 (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse146 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (not (= v_prenex_245 (_ bv13 32))) (= (store .cse146 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (= .cse9 (store .cse146 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse146 v_prenex_246))))))))) (.cse116 (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32))) (let ((.cse145 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (= (store .cse145 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (= .cse2 (store .cse145 v_prenex_238 .cse3)) (= (store .cse145 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse145 v_prenex_240)))) .cse9))))) (.cse120 (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse144 (select |c_#memory_int| v_prenex_242))) (and (= .cse2 (store .cse144 v_prenex_241 .cse3)) (= (store .cse144 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (not (= v_prenex_243 v_prenex_241)) (= (store .cse144 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse144 v_prenex_243)))) .cse9))))) (.cse86 (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse143 (select |c_#memory_int| v_prenex_242))) (and (not (= v_prenex_242 (_ bv13 32))) (= .cse2 (store .cse143 v_prenex_241 .cse3)) (= (store .cse143 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (not (= v_prenex_243 v_prenex_241)) (= (store .cse143 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse143 v_prenex_243)))) .cse9))))) (.cse91 (= (store .cse2 c_~var_1_15_Pointer~0.offset .cse4) .cse9)) (.cse102 (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (and (= (store .cse9 v_prenex_241 .cse3) .cse2) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_243))) .cse4) (not (= v_prenex_243 v_prenex_241))))) (.cse82 (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_246))) .cse4)))) (.cse131 (exists ((~var_1_16_Pointer~0.offset (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_16_Pointer~0.offset))) .cse4))) (.cse67 (exists ((v_prenex_240 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_240)))))) (.cse68 (exists ((v_prenex_238 (_ BitVec 32))) (= .cse2 (store .cse9 v_prenex_238 .cse3)))) (.cse72 (exists ((~var_1_16_Pointer~0.base (_ BitVec 32))) (= (select |c_#memory_int| ~var_1_16_Pointer~0.base) .cse9))) (.cse90 (or (exists ((v_prenex_240 (_ BitVec 32))) (let ((.cse142 (select .cse9 v_prenex_240))) (and (= .cse142 .cse11) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) .cse142)))))) (exists ((v_prenex_240 (_ BitVec 32))) (and (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_240)))) (not (= v_prenex_240 c_~var_1_15_Pointer~0.offset)))))) (.cse89 (= .cse20 .cse11)) (.cse70 (exists ((v_prenex_248 (_ BitVec 32)) (v_prenex_247 (_ BitVec 32))) (and (= (store .cse2 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_248)))) .cse9) (not (= v_prenex_247 v_prenex_248)) (= (select .cse2 v_prenex_247) .cse3)))) (.cse141 (= .cse2 .cse87)) (.cse125 (exists ((v_prenex_243 (_ BitVec 32))) (and (not (= v_prenex_243 c_~var_1_15_Pointer~0.offset)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_243))) .cse4))))) (or (and .cse23 .cse67 .cse68) (and .cse57 (exists ((~var_1_16_Pointer~0.base (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse69 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= (select |c_#memory_int| v_prenex_245) (store .cse69 c_~var_1_15_Pointer~0.offset .cse11)) (= (store .cse69 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse69 ~var_1_16_Pointer~0.offset)))) .cse9))))) (and .cse70 (exists ((v_prenex_239 (_ BitVec 32))) (= (select |c_#memory_int| v_prenex_239) .cse71))) (and .cse70 .cse72 .cse73) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse74 (select |c_#memory_int| v_prenex_242))) (and (not (= v_prenex_242 (_ bv13 32))) (= .cse2 (store .cse74 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241)) (= (store .cse74 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse74 v_prenex_243)))) .cse9)))) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse75 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse2 v_prenex_244) .cse3) (= (select .cse75 c_~var_1_15_Pointer~0.offset) .cse11) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (= .cse9 (store .cse75 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse75 v_prenex_246))))) (= .cse75 .cse9)))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse77 (select |c_#memory_int| v_prenex_239)) (.cse76 (select |c_#memory_int| v_prenex_242))) (and (= .cse2 (store .cse76 v_prenex_241 .cse3)) (= .cse77 .cse9) (= .cse77 (store .cse76 c_~var_1_15_Pointer~0.offset .cse11)) (not (= v_prenex_243 v_prenex_241)) (= (store .cse76 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse76 v_prenex_243)))) .cse9)))) (exists ((v_prenex_239 (_ BitVec 32)) (v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse78 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (not (= v_prenex_245 (_ bv13 32))) (= .cse9 (store .cse78 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse78 v_prenex_246))))) (= (select |c_#memory_int| v_prenex_239) (store .cse78 c_~var_1_15_Pointer~0.offset .cse11))))) .cse70 .cse79 (exists ((v_prenex_244 (_ BitVec 32))) (and (= (select .cse2 v_prenex_244) .cse3) (exists ((v_prenex_246 (_ BitVec 32))) (and (not (= v_prenex_244 v_prenex_246)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_246))) .cse4) (not (= v_prenex_246 c_~var_1_15_Pointer~0.offset)))))) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32))) (let ((.cse80 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (= (select .cse80 c_~var_1_15_Pointer~0.offset) .cse11) (= .cse2 (store .cse80 v_prenex_238 .cse3)) (= (store .cse80 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse80 v_prenex_240)))) .cse9)))) (exists ((v_prenex_244 (_ BitVec 32))) (and (= (select .cse2 v_prenex_244) .cse3) (exists ((v_prenex_246 (_ BitVec 32))) (let ((.cse81 (select .cse9 v_prenex_246))) (and (not (= v_prenex_244 v_prenex_246)) (= .cse81 .cse11) (= ((_ sign_extend 24) ((_ extract 7 0) .cse81)) .cse4)))))) (and .cse23 .cse82) (and .cse57 (or .cse58 (exists ((~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse83 (select .cse9 ~var_1_16_Pointer~0.offset))) (and (= ((_ sign_extend 24) ((_ extract 7 0) .cse83)) .cse4) (= .cse83 .cse11)))) (exists ((~var_1_16_Pointer~0.base (_ BitVec 32))) (let ((.cse84 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (exists ((~var_1_16_Pointer~0.offset (_ BitVec 32))) (= (store .cse84 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse84 ~var_1_16_Pointer~0.offset)))) .cse9)) (= .cse11 (select .cse84 c_~var_1_15_Pointer~0.offset))))))) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse85 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse2 v_prenex_244) .cse3) (= (select .cse85 c_~var_1_15_Pointer~0.offset) .cse11) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (= .cse9 (store .cse85 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse85 v_prenex_246)))))))) (and .cse86 .cse72) (and (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse88 (select .cse2 v_prenex_241))) (and (= .cse2 (store .cse87 v_prenex_241 .cse88)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_243))) .cse4) (= .cse88 .cse3) (not (= v_prenex_243 v_prenex_241))))) .cse89) (and .cse90 (or (and .cse89 (exists ((v_prenex_238 (_ BitVec 32))) (and (= (store (store .cse2 v_prenex_238 (select .cse9 v_prenex_238)) c_~var_1_15_Pointer~0.offset .cse4) .cse9) (= .cse3 (select .cse2 v_prenex_238))))) (and .cse41 .cse91))) (and .cse70 .cse73) (exists ((v_prenex_239 (_ BitVec 32)) (v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse92 (select |c_#memory_int| v_prenex_239)) (.cse93 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse2 v_prenex_244) .cse3) (= .cse92 .cse9) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (not (= v_prenex_245 (_ bv13 32))) (= .cse9 (store .cse93 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse93 v_prenex_246))))) (= .cse92 (store .cse93 c_~var_1_15_Pointer~0.offset .cse11))))) (and (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_prenex_243))) .cse4) (= (select .cse2 v_prenex_241) .cse3) (not (= v_prenex_243 v_prenex_241)) (= (store (store .cse2 v_prenex_241 (select .cse9 v_prenex_241)) c_~var_1_15_Pointer~0.offset .cse4) .cse9))) .cse89) (and .cse57 (exists ((v_prenex_239 (_ BitVec 32)) (~var_1_16_Pointer~0.base (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse94 (select |c_#memory_int| v_prenex_239)) (.cse95 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= .cse94 .cse9) (= (store .cse95 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse95 ~var_1_16_Pointer~0.offset)))) .cse9) (= .cse94 (store .cse95 c_~var_1_15_Pointer~0.offset .cse11)))))) (and .cse57 (exists ((~var_1_16_Pointer~0.base (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse96 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= (select |c_#memory_int| v_prenex_242) (store .cse96 c_~var_1_15_Pointer~0.offset .cse11)) (= (store .cse96 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse96 ~var_1_16_Pointer~0.offset)))) .cse9))))) (and .cse57 (exists ((~var_1_16_Pointer~0.base (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse98 (select |c_#memory_int| ~var_1_16_Pointer~0.base)) (.cse97 (select |c_#memory_int| v_prenex_245))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= .cse97 (store .cse98 c_~var_1_15_Pointer~0.offset .cse11)) (= (store .cse98 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse98 ~var_1_16_Pointer~0.offset)))) .cse9) (= .cse97 .cse9))))) (exists ((v_prenex_239 (_ BitVec 32))) (let ((.cse99 (select |c_#memory_int| v_prenex_239))) (and (exists ((v_prenex_240 (_ BitVec 32))) (= (store .cse99 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse99 v_prenex_240)))) .cse9)) (not (= v_prenex_239 (_ bv12 32))) (= (store .cse99 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (not (= v_prenex_239 (_ bv13 32))) (exists ((v_prenex_238 (_ BitVec 32))) (= .cse2 (store .cse99 v_prenex_238 .cse3)))))) .cse100 (exists ((v_prenex_242 (_ BitVec 32))) (let ((.cse101 (select |c_#memory_int| v_prenex_242))) (and (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (and (= .cse2 (store .cse101 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241)) (= (store .cse101 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse101 v_prenex_243)))) .cse9))) (= (store .cse101 c_~var_1_15_Pointer~0.offset .cse11) .cse9)))) (and .cse23 .cse102) (and .cse79 .cse72) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (not (= v_prenex_245 (_ bv13 32))) (= .cse9 (let ((.cse103 (select |c_#memory_int| v_prenex_245))) (store .cse103 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse103 v_prenex_246)))))))) (exists ((v_prenex_245 (_ BitVec 32))) (let ((.cse104 (select |c_#memory_int| v_prenex_245))) (and (not (= v_prenex_245 (_ bv12 32))) (not (= v_prenex_245 (_ bv13 32))) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (= .cse9 (store .cse104 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse104 v_prenex_246))))))) (= (store .cse104 c_~var_1_15_Pointer~0.offset .cse11) .cse9)))) (and .cse100 .cse72) (exists ((v_prenex_239 (_ BitVec 32))) (let ((.cse105 (select |c_#memory_int| v_prenex_239))) (and (exists ((v_prenex_240 (_ BitVec 32))) (= (store .cse105 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse105 v_prenex_240)))) .cse9)) (not (= v_prenex_239 (_ bv12 32))) (= (store .cse105 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (exists ((v_prenex_238 (_ BitVec 32))) (= .cse2 (store .cse105 v_prenex_238 .cse3)))))) (and .cse70 (exists ((v_prenex_239 (_ BitVec 32))) (let ((.cse106 (select |c_#memory_int| v_prenex_239))) (and (= .cse106 .cse71) (= .cse106 .cse9))))) (exists ((v_prenex_245 (_ BitVec 32))) (let ((.cse107 (select |c_#memory_int| v_prenex_245))) (and (not (= v_prenex_245 (_ bv12 32))) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (= .cse9 (store .cse107 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse107 v_prenex_246))))))) (= (store .cse107 c_~var_1_15_Pointer~0.offset .cse11) .cse9)))) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32))) (let ((.cse108 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (= .cse108 .cse9) (= (select .cse108 c_~var_1_15_Pointer~0.offset) .cse11) (= .cse2 (store .cse108 v_prenex_238 .cse3)) (= (store .cse108 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse108 v_prenex_240)))) .cse9)))) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 v_prenex_246))) .cse4) (not (= v_prenex_246 c_~var_1_15_Pointer~0.offset)))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse109 (select |c_#memory_int| v_prenex_242))) (and (= .cse2 (store .cse109 v_prenex_241 .cse3)) (= (select .cse109 c_~var_1_15_Pointer~0.offset) .cse11) (not (= v_prenex_243 v_prenex_241)) (= (store .cse109 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse109 v_prenex_243)))) .cse9)))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse110 (select |c_#memory_int| v_prenex_242))) (and (not (= v_prenex_242 (_ bv13 32))) (= .cse2 (store .cse110 v_prenex_241 .cse3)) (= (select |c_#memory_int| v_prenex_239) (store .cse110 c_~var_1_15_Pointer~0.offset .cse11)) (not (= v_prenex_243 v_prenex_241)) (= (store .cse110 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse110 v_prenex_243)))) .cse9)))) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse112 (select |c_#memory_int| v_prenex_245)) (.cse111 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (= (store .cse111 c_~var_1_15_Pointer~0.offset .cse11) .cse112) (= .cse2 (store .cse111 v_prenex_238 .cse3)) (= .cse112 .cse9) (= (store .cse111 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse111 v_prenex_240)))) .cse9)))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse114 (select |c_#memory_int| v_prenex_245)) (.cse113 (select |c_#memory_int| v_prenex_242))) (and (= .cse2 (store .cse113 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241)) (= .cse114 .cse9) (= (store .cse113 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse113 v_prenex_243)))) .cse9) (= .cse114 (store .cse113 c_~var_1_15_Pointer~0.offset .cse11))))) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32))) (let ((.cse115 (select .cse9 v_prenex_246))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (= .cse115 .cse11) (= ((_ sign_extend 24) ((_ extract 7 0) .cse115)) .cse4)))) .cse116 (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse117 (select |c_#memory_int| v_prenex_245))) (and (= (store .cse117 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse117 v_prenex_243)))) .cse9) (= (select .cse117 c_~var_1_15_Pointer~0.offset) .cse11) (= .cse2 (store .cse117 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241)) (= .cse117 .cse9)))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse118 (select |c_#memory_int| v_prenex_242))) (and (not (= v_prenex_242 (_ bv13 32))) (= .cse2 (store .cse118 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241)) (= (store .cse118 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse118 v_prenex_243)))) .cse9) (= (select |c_#memory_int| v_prenex_245) (store .cse118 c_~var_1_15_Pointer~0.offset .cse11))))) (and .cse116 .cse72) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32))) (let ((.cse119 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (not (= v_prenex_239 (_ bv13 32))) (= .cse2 (store .cse119 v_prenex_238 .cse3)) (= (store .cse119 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse119 v_prenex_240)))) .cse9)))) .cse120 (and (exists ((~var_1_16_Pointer~0.base (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= (let ((.cse121 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (store .cse121 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse121 ~var_1_16_Pointer~0.offset))))) .cse9))) .cse57) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse122 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (not (= v_prenex_239 (_ bv13 32))) (= (store .cse122 c_~var_1_15_Pointer~0.offset .cse11) (select |c_#memory_int| v_prenex_245)) (= .cse2 (store .cse122 v_prenex_238 .cse3)) (= (store .cse122 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse122 v_prenex_240)))) .cse9)))) (and .cse120 .cse72) .cse86 (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse124 (select |c_#memory_int| v_prenex_245)) (.cse123 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (not (= v_prenex_239 (_ bv13 32))) (= (store .cse123 c_~var_1_15_Pointer~0.offset .cse11) .cse124) (= .cse2 (store .cse123 v_prenex_238 .cse3)) (= .cse124 .cse9) (= (store .cse123 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse123 v_prenex_240)))) .cse9)))) (and .cse41 .cse91 .cse125) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse126 (select |c_#memory_int| v_prenex_239))) (and (= (store .cse126 v_prenex_241 .cse3) .cse2) (= (select .cse126 c_~var_1_15_Pointer~0.offset) .cse11) (not (= v_prenex_243 v_prenex_241)) (= (store .cse126 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse126 v_prenex_243)))) .cse9)))) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse127 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse127 c_~var_1_15_Pointer~0.offset) .cse11) (= (store .cse127 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse127 v_prenex_240)))) .cse9) (= .cse2 (store .cse127 v_prenex_238 .cse3))))) (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32))) (let ((.cse128 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse2 v_prenex_244) .cse3) (= (select |c_#memory_int| v_prenex_242) (store .cse128 c_~var_1_15_Pointer~0.offset .cse11)) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (not (= v_prenex_245 (_ bv13 32))) (= .cse9 (store .cse128 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse128 v_prenex_246)))))))) (and .cse57 (exists ((v_prenex_239 (_ BitVec 32)) (~var_1_16_Pointer~0.base (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse129 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= (store .cse129 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse129 ~var_1_16_Pointer~0.offset)))) .cse9) (= (select |c_#memory_int| v_prenex_239) (store .cse129 c_~var_1_15_Pointer~0.offset .cse11)))))) (and .cse70 (exists ((v_prenex_245 (_ BitVec 32))) (let ((.cse130 (select |c_#memory_int| v_prenex_245))) (and (= .cse130 .cse71) (= .cse130 .cse9))))) (and .cse23 .cse72 .cse102) (and .cse23 .cse72 .cse82) (and .cse23 .cse57 .cse131) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse132 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse132 c_~var_1_15_Pointer~0.offset) .cse11) (= (store .cse132 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse132 v_prenex_240)))) .cse9) (= .cse2 (store .cse132 v_prenex_238 .cse3)) (= .cse132 .cse9)))) (exists ((v_prenex_240 (_ BitVec 32)) (v_prenex_239 (_ BitVec 32)) (v_prenex_238 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32))) (let ((.cse133 (select |c_#memory_int| v_prenex_239))) (and (not (= v_prenex_239 (_ bv12 32))) (= (select |c_#memory_int| v_prenex_242) (store .cse133 c_~var_1_15_Pointer~0.offset .cse11)) (not (= v_prenex_239 (_ bv13 32))) (= .cse2 (store .cse133 v_prenex_238 .cse3)) (= (store .cse133 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse133 v_prenex_240)))) .cse9)))) (and .cse70 (exists ((v_prenex_245 (_ BitVec 32))) (= (select |c_#memory_int| v_prenex_245) .cse71))) (and .cse72 (exists ((v_prenex_246 (_ BitVec 32)) (v_prenex_244 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32))) (let ((.cse134 (select |c_#memory_int| v_prenex_245))) (and (= (select .cse2 v_prenex_244) .cse3) (not (= v_prenex_244 v_prenex_246)) (not (= v_prenex_245 (_ bv12 32))) (= (store .cse134 c_~var_1_15_Pointer~0.offset .cse11) .cse9) (= .cse9 (store .cse134 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse134 v_prenex_246))))))))) (exists ((v_prenex_242 (_ BitVec 32))) (let ((.cse135 (select |c_#memory_int| v_prenex_242))) (and (not (= v_prenex_242 (_ bv13 32))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (and (= .cse2 (store .cse135 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241)) (= (store .cse135 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse135 v_prenex_243)))) .cse9))) (= (store .cse135 c_~var_1_15_Pointer~0.offset .cse11) .cse9)))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_242 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse137 (select |c_#memory_int| v_prenex_245)) (.cse136 (select |c_#memory_int| v_prenex_242))) (and (not (= v_prenex_242 (_ bv13 32))) (= .cse2 (store .cse136 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241)) (= .cse137 .cse9) (= (store .cse136 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse136 v_prenex_243)))) .cse9) (= .cse137 (store .cse136 c_~var_1_15_Pointer~0.offset .cse11))))) (and .cse57 (exists ((~var_1_16_Pointer~0.base (_ BitVec 32)) (~var_1_16_Pointer~0.offset (_ BitVec 32))) (let ((.cse138 (select |c_#memory_int| ~var_1_16_Pointer~0.base))) (and (not (= ~var_1_16_Pointer~0.base (_ bv12 32))) (not (= ~var_1_16_Pointer~0.base (_ bv13 32))) (= .cse9 (store .cse138 c_~var_1_15_Pointer~0.offset .cse11)) (= (store .cse138 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse138 ~var_1_16_Pointer~0.offset)))) .cse9))))) (exists ((v_prenex_241 (_ BitVec 32)) (v_prenex_245 (_ BitVec 32)) (v_prenex_243 (_ BitVec 32))) (let ((.cse139 (select |c_#memory_int| v_prenex_245))) (and (= (store .cse139 c_~var_1_15_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select .cse139 v_prenex_243)))) .cse9) (= (select .cse139 c_~var_1_15_Pointer~0.offset) .cse11) (= .cse2 (store .cse139 v_prenex_241 .cse3)) (not (= v_prenex_243 v_prenex_241))))) (and .cse23 .cse57 .cse131 (exists ((~var_1_16_Pointer~0.base (_ BitVec 32))) (and (= (select |c_#memory_int| ~var_1_16_Pointer~0.base) .cse9) (not (= ~var_1_16_Pointer~0.base (_ bv12 32)))))) (and .cse23 .cse67 .cse68 .cse72) (and .cse90 (or (and (exists ((v_prenex_238 (_ BitVec 32))) (let ((.cse140 (select .cse2 v_prenex_238))) (and (= (store .cse87 v_prenex_238 .cse140) .cse2) (= .cse3 .cse140)))) .cse89) (and .cse41 .cse141))) (and .cse70 (exists ((v_prenex_242 (_ BitVec 32))) (= (select |c_#memory_int| v_prenex_242) .cse71))) (and .cse41 .cse141 .cse125)))))))))) is different from false [2023-12-02 17:39:22,871 WARN L293 SmtUtils]: Spent 47.13s on a formula simplification that was a NOOP. DAG size: 1585 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)