./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.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_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:57:53,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:57:53,883 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:57:53,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:57:53,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:57:53,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:57:53,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:57:53,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:57:53,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:57:53,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:57:53,917 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:57:53,917 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:57:53,918 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:57:53,918 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:57:53,919 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:57:53,920 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:57:53,920 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:57:53,921 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:57:53,921 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:57:53,922 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:57:53,922 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:57:53,923 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:57:53,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:57:53,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:57:53,925 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:57:53,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:57:53,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:57:53,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:57:53,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:57:53,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:57:53,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:57:53,928 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:57:53,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:57:53,929 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:57:53,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:57:53,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:57:53,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:57:53,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:57:53,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:57:53,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:57:53,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:57:53,931 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:57:53,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:57:53,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:57:53,931 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:57:53,932 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:57:53,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:57:53,932 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_2cac062c-7281-4757-b0bd-612cf9fa4bae/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_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 -> 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a [2023-12-02 15:57:54,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:57:54,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:57:54,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:57:54,162 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:57:54,163 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:57:54,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-12-02 15:57:56,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:57:57,160 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:57:57,161 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-12-02 15:57:57,169 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data/301b4b9f2/f4957c89fed547b48934d619e4f5d14a/FLAG773c860d1 [2023-12-02 15:57:57,185 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data/301b4b9f2/f4957c89fed547b48934d619e4f5d14a [2023-12-02 15:57:57,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:57:57,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:57:57,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:57:57,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:57:57,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:57:57,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6950d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57, skipping insertion in model container [2023-12-02 15:57:57,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,227 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:57:57,378 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_2cac062c-7281-4757-b0bd-612cf9fa4bae/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-12-02 15:57:57,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:57:57,430 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:57:57,443 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_2cac062c-7281-4757-b0bd-612cf9fa4bae/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-12-02 15:57:57,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:57:57,478 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:57:57,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57 WrapperNode [2023-12-02 15:57:57,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:57:57,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:57:57,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:57:57,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:57:57,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,527 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2023-12-02 15:57:57,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:57:57,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:57:57,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:57:57,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:57:57,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:57:57,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:57:57,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:57:57,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:57:57,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (1/1) ... [2023-12-02 15:57:57,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:57:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:57:57,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:57:57,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:57:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:57:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 15:57:57,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 15:57:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:57:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:57:57,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:57:57,701 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:57:57,704 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:57:57,915 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:57:58,076 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:57:58,076 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 15:57:58,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:57:58 BoogieIcfgContainer [2023-12-02 15:57:58,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:57:58,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:57:58,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:57:58,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:57:58,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:57:57" (1/3) ... [2023-12-02 15:57:58,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fd3ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:57:58, skipping insertion in model container [2023-12-02 15:57:58,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:57:57" (2/3) ... [2023-12-02 15:57:58,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fd3ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:57:58, skipping insertion in model container [2023-12-02 15:57:58,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:57:58" (3/3) ... [2023-12-02 15:57:58,088 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-9.i [2023-12-02 15:57:58,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:57:58,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:57:58,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:57:58,169 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;@4c81501c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:57:58,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:57:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:57:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:57:58,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:57:58,182 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:57:58,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:57:58,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:57:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -675821967, now seen corresponding path program 1 times [2023-12-02 15:57:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:57:58,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215448542] [2023-12-02 15:57:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:57:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:57:58,313 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 15:57:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379676120] [2023-12-02 15:57:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:57:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:57:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:57:58,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:57:58,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:57:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:57:58,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:57:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:57:58,524 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:57:58,527 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:57:58,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:57:58,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:57:58,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 15:57:58,735 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 15:57:58,739 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:57:58,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:57:58 BoogieIcfgContainer [2023-12-02 15:57:58,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:57:58,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:57:58,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:57:58,770 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:57:58,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:57:58" (3/4) ... [2023-12-02 15:57:58,773 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:57:58,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:57:58,775 INFO L158 Benchmark]: Toolchain (without parser) took 1585.50ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 100.9MB in the beginning and 140.0MB in the end (delta: -39.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-12-02 15:57:58,775 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:57:58,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.19ms. Allocated memory is still 138.4MB. Free memory was 100.5MB in the beginning and 88.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 15:57:58,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.85ms. Allocated memory is still 138.4MB. Free memory was 88.6MB in the beginning and 86.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:57:58,777 INFO L158 Benchmark]: Boogie Preprocessor took 29.39ms. Allocated memory is still 138.4MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:57:58,778 INFO L158 Benchmark]: RCFGBuilder took 519.26ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 84.4MB in the beginning and 165.1MB in the end (delta: -80.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-12-02 15:57:58,779 INFO L158 Benchmark]: TraceAbstraction took 687.54ms. Allocated memory is still 201.3MB. Free memory was 164.1MB in the beginning and 141.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 15:57:58,779 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 140.9MB in the end (delta: 150.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:57:58,783 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.17ms. Allocated memory is still 138.4MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.19ms. Allocated memory is still 138.4MB. Free memory was 100.5MB in the beginning and 88.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.85ms. Allocated memory is still 138.4MB. Free memory was 88.6MB in the beginning and 86.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.39ms. Allocated memory is still 138.4MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 519.26ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 84.4MB in the beginning and 165.1MB in the end (delta: -80.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 687.54ms. Allocated memory is still 201.3MB. Free memory was 164.1MB in the beginning and 141.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 140.9MB in the end (delta: 150.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryDOUBLEComparisonOperation at line 38, overapproximation of shiftLeft at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed long int var_1_14 = -16; [L31] unsigned char last_1_var_1_1 = 10; [L32] double last_1_var_1_10 = 9.2; [L33] signed short int last_1_var_1_12 = 1; [L34] signed long int last_1_var_1_14 = -16; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L75] last_1_var_1_1 = var_1_1 [L76] last_1_var_1_10 = var_1_10 [L77] last_1_var_1_12 = var_1_12 [L78] last_1_var_1_14 = var_1_14 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L67] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) [L67] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_7=0, var_1_8=100, var_1_9=32] [L68] var_1_7 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_8=100, var_1_9=32] [L70] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_7=1, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) [L70] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_7=1, var_1_8=100, var_1_9=32] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_7=1, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=50, var_1_7=1, var_1_8=100, var_1_9=32] [L89] RET updateVariables() [L90] CALL step() [L38] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; [L39] COND TRUE ((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0 [L40] var_1_12 = ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))) [L44] var_1_14 = var_1_12 [L45] EXPR 10 << var_1_12 [L45] COND FALSE !((10 << var_1_12) < (var_1_3 * var_1_14)) [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 [L50] COND FALSE !(var_1_12 <= 16) [L53] COND FALSE !(((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) [L60] var_1_1 = var_1_3 [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) [L81] EXPR 10 << var_1_12 [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) [L81-L82] return ((((((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? (var_1_12 == ((signed short int) ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : (var_1_12 == ((signed short int) last_1_var_1_12)))) && (var_1_14 == ((signed long int) var_1_12)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=50, var_1_14=50, var_1_1=50, var_1_3=50, var_1_7=1, var_1_8=100, var_1_9=64] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=50, var_1_14=50, var_1_1=50, var_1_3=50, var_1_7=1, var_1_8=100, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 5, 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=17occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 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 15:57:58,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:58:00,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:58:00,857 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 15:58:00,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:58:00,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:58:00,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:58:00,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:58:00,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:58:00,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:58:00,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:58:00,891 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:58:00,891 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:58:00,892 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:58:00,892 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:58:00,893 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:58:00,894 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:58:00,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:58:00,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:58:00,896 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:58:00,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:58:00,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:58:00,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:58:00,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:58:00,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:58:00,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:58:00,899 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:58:00,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:58:00,900 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:58:00,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:58:00,900 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:58:00,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:58:00,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:58:00,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:58:00,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:58:00,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:58:00,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:58:00,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:58:00,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:58:00,903 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:58:00,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:58:00,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:58:00,903 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:58:00,904 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:58:00,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:58:00,904 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_2cac062c-7281-4757-b0bd-612cf9fa4bae/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_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 -> 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a [2023-12-02 15:58:01,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:58:01,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:58:01,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:58:01,231 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:58:01,231 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:58:01,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-12-02 15:58:04,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:58:04,233 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:58:04,234 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-12-02 15:58:04,244 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data/5dc2651ad/59e134c0921c47c4b9055bb433ad9ad8/FLAG7de2ce7f6 [2023-12-02 15:58:04,256 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/data/5dc2651ad/59e134c0921c47c4b9055bb433ad9ad8 [2023-12-02 15:58:04,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:58:04,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:58:04,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:58:04,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:58:04,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:58:04,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6308ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04, skipping insertion in model container [2023-12-02 15:58:04,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,294 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:58:04,450 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_2cac062c-7281-4757-b0bd-612cf9fa4bae/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-12-02 15:58:04,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:58:04,505 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:58:04,516 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_2cac062c-7281-4757-b0bd-612cf9fa4bae/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-12-02 15:58:04,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:58:04,554 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:58:04,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04 WrapperNode [2023-12-02 15:58:04,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:58:04,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:58:04,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:58:04,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:58:04,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,598 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2023-12-02 15:58:04,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:58:04,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:58:04,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:58:04,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:58:04,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:58:04,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:58:04,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:58:04,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:58:04,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (1/1) ... [2023-12-02 15:58:04,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:58:04,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:58:04,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:58:04,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:58:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:58:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:58:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 15:58:04,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 15:58:04,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:58:04,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:58:04,781 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:58:04,784 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:58:05,007 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:58:05,058 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:58:05,059 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 15:58:05,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:58:05 BoogieIcfgContainer [2023-12-02 15:58:05,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:58:05,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:58:05,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:58:05,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:58:05,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:58:04" (1/3) ... [2023-12-02 15:58:05,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dd02a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:58:05, skipping insertion in model container [2023-12-02 15:58:05,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:58:04" (2/3) ... [2023-12-02 15:58:05,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dd02a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:58:05, skipping insertion in model container [2023-12-02 15:58:05,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:58:05" (3/3) ... [2023-12-02 15:58:05,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-9.i [2023-12-02 15:58:05,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:58:05,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:58:05,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:58:05,131 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;@3cf446fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:58:05,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:58:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:58:05,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:58:05,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:58:05,142 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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 15:58:05,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:58:05,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:58:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1874091188, now seen corresponding path program 1 times [2023-12-02 15:58:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:58:05,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092353574] [2023-12-02 15:58:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:58:05,159 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 15:58:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:58:05,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:05,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:58:05,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 15:58:05,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:58:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 15:58:05,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:58:05,378 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:58:05,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092353574] [2023-12-02 15:58:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092353574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:58:05,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:58:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:58:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933490341] [2023-12-02 15:58:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:58:05,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:58:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:58:05,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:58:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:58:05,417 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:58:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:58:05,474 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2023-12-02 15:58:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:58:05,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-02 15:58:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:58:05,485 INFO L225 Difference]: With dead ends: 52 [2023-12-02 15:58:05,485 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 15:58:05,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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 15:58:05,492 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:58:05,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:58:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 15:58:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-02 15:58:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:58:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-02 15:58:05,531 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 38 [2023-12-02 15:58:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:58:05,531 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-02 15:58:05,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:58:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-02 15:58:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:58:05,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:58:05,534 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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 15:58:05,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:05,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:05,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:58:05,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:58:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1769860978, now seen corresponding path program 1 times [2023-12-02 15:58:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:58:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729002219] [2023-12-02 15:58:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:58:05,740 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 15:58:05,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:58:05,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:05,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:58:05,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:58:05,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:58:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 15:58:06,177 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:58:06,178 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:58:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729002219] [2023-12-02 15:58:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729002219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:58:06,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:58:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:58:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82082869] [2023-12-02 15:58:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:58:06,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:58:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:58:06,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:58:06,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:58:06,183 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:58:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:58:06,415 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2023-12-02 15:58:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:58:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-02 15:58:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:58:06,417 INFO L225 Difference]: With dead ends: 73 [2023-12-02 15:58:06,418 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 15:58:06,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:58:06,420 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:58:06,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:58:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 15:58:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-12-02 15:58:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:58:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-12-02 15:58:06,437 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 38 [2023-12-02 15:58:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:58:06,438 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-12-02 15:58:06,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:58:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-12-02 15:58:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:58:06,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:58:06,441 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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 15:58:06,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:06,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:06,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:58:06,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:58:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 960514352, now seen corresponding path program 1 times [2023-12-02 15:58:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:58:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628331465] [2023-12-02 15:58:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:58:06,644 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 15:58:06,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:58:06,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:06,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:58:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:58:06,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 15:58:06,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:59:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:59:15,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:59:15,883 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:59:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628331465] [2023-12-02 15:59:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628331465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:59:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:59:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 15:59:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938332275] [2023-12-02 15:59:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:59:15,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:59:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:59:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:59:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:59:15,886 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:59:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:59:16,989 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-12-02 15:59:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 15:59:16,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-02 15:59:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:59:16,992 INFO L225 Difference]: With dead ends: 63 [2023-12-02 15:59:16,992 INFO L226 Difference]: Without dead ends: 61 [2023-12-02 15:59:16,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-02 15:59:16,994 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:59:16,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 149 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:59:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-02 15:59:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2023-12-02 15:59:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:59:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-12-02 15:59:17,006 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 38 [2023-12-02 15:59:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:59:17,006 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-12-02 15:59:17,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:59:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-12-02 15:59:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:59:17,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:59:17,008 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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 15:59:17,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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)] Ended with exit code 0 [2023-12-02 15:59:17,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:17,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:59:17,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:59:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1017772654, now seen corresponding path program 1 times [2023-12-02 15:59:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:59:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774095450] [2023-12-02 15:59:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:59:17,210 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 15:59:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:59:17,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:17,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:59:17,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 15:59:17,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:59:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:59:56,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:59:56,945 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:59:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774095450] [2023-12-02 15:59:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774095450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:59:56,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:59:56,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 15:59:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409583668] [2023-12-02 15:59:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:59:56,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:59:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:59:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:59:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:59:56,948 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:59:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:59:58,407 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2023-12-02 15:59:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 15:59:58,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-02 15:59:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:59:58,408 INFO L225 Difference]: With dead ends: 61 [2023-12-02 15:59:58,408 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 15:59:58,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-02 15:59:58,410 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 70 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:59:58,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 126 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 15:59:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 15:59:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2023-12-02 15:59:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 15:59:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-02 15:59:58,417 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 38 [2023-12-02 15:59:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:59:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-02 15:59:58,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:59:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-02 15:59:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 15:59:58,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:59:58,420 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:59:58,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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)] Ended with exit code 0 [2023-12-02 15:59:58,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:58,621 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:59:58,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:59:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash 772996836, now seen corresponding path program 1 times [2023-12-02 15:59:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:59:58,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082874602] [2023-12-02 15:59:58,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:59:58,622 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 15:59:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:59:58,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:58,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:59:58,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:59:58,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:59:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:59:58,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:59:58,988 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:59:58,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082874602] [2023-12-02 15:59:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082874602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:59:58,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:59:58,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:59:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220433362] [2023-12-02 15:59:58,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:59:58,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:59:58,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:59:58,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:59:58,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:59:58,990 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:59:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:59:59,693 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2023-12-02 15:59:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:59:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2023-12-02 15:59:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:59:59,697 INFO L225 Difference]: With dead ends: 150 [2023-12-02 15:59:59,697 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 15:59:59,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2023-12-02 15:59:59,698 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 132 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:59:59,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 166 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:59:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 15:59:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2023-12-02 15:59:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 states have internal predecessors, (76), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:59:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2023-12-02 15:59:59,713 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 75 [2023-12-02 15:59:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:59:59,714 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2023-12-02 15:59:59,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 15:59:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2023-12-02 15:59:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 15:59:59,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:59:59,716 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-02 15:59:59,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:59,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:59,917 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:59:59,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:59:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash -36349790, now seen corresponding path program 1 times [2023-12-02 15:59:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:59:59,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251449455] [2023-12-02 15:59:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:59:59,919 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 15:59:59,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:59:59,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 15:59:59,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 16:00:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:00:00,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 16:00:00,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:01:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-12-02 16:01:46,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:03:32,737 WARN L293 SmtUtils]: Spent 13.59s on a formula simplification that was a NOOP. DAG size: 284 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:04:20,223 WARN L293 SmtUtils]: Spent 15.20s on a formula simplification that was a NOOP. DAG size: 278 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:05:02,200 WARN L293 SmtUtils]: Spent 9.93s on a formula simplification that was a NOOP. DAG size: 237 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:05:47,358 WARN L293 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:06:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-12-02 16:06:02,105 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 16:06:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251449455] [2023-12-02 16:06:02,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251449455] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 16:06:02,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:06:02,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2023-12-02 16:06:02,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458522003] [2023-12-02 16:06:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:06:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 16:06:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 16:06:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 16:06:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=298, Unknown=25, NotChecked=0, Total=420 [2023-12-02 16:06:02,108 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-02 16:06:04,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:08,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:14,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:18,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:20,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:22,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:28,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:29,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:41,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:43,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:45,790 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 16) c_~var_1_12~0)) (.cse7 ((_ sign_extend 16) c_~last_1_var_1_12~0)) (.cse6 ((_ zero_extend 24) c_~last_1_var_1_1~0))) (let ((.cse8 (bvslt (bvadd .cse7 .cse6) (_ bv10 32))) (.cse94 (fp.eq c_~var_1_11~0 c_~var_1_11~0)) (.cse184 (= .cse2 c_~var_1_14~0))) (let ((.cse31 (and .cse94 .cse184)) (.cse0 (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse6)))) (.cse55 (not .cse8)) (.cse1 (= .cse7 .cse2)) (.cse4 (bvshl (_ bv10 32) .cse2)) (.cse13 (bvneg .cse7))) (let ((.cse29 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse212 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse212)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse212 (bvneg ~last_1_var_1_14~0)) .cse6)))))) (.cse30 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse211 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse211 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse211)))))))) (.cse10 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse209 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse210 (bvadd .cse7 .cse209 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt (bvadd .cse7 .cse13 .cse209) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse210)))) (not (bvsgt .cse210 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse8)) (.cse68 (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse208 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse208 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse208))))) (bvslt .cse4 (bvmul .cse2 .cse208))))) .cse8)) (.cse73 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse206 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse207 (bvadd .cse7 .cse206 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse206))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse207)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse206))))) (not (bvsgt .cse207 .cse6)))))) .cse1 .cse8)) (.cse87 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse205 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse205))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse205))))) (not (bvsgt (bvadd .cse7 .cse205 (bvneg ~last_1_var_1_14~0)) .cse6))))) .cse1 .cse8)) (.cse92 (or .cse94 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse201 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse201))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse201 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse201))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse202 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse202 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse202))))) (bvslt .cse4 (bvmul .cse2 .cse202))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse203 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse203))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse203))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse203 (bvneg ~last_1_var_1_14~0)) .cse6))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse204 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse204))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse204 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse204))))))))))) (.cse9 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse200 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse199 (bvadd .cse7 .cse13 .cse200))) (or (bvsgt .cse199 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse199))) (not (bvslt .cse4 (bvmul .cse200 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse200 (bvneg ~last_1_var_1_14~0)) .cse6))))))) (.cse18 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse198 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse197 (bvadd .cse7 .cse13 .cse198))) (or (bvsgt .cse197 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse197))) (not (bvslt .cse4 (bvmul .cse198 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse198 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))))) (.cse97 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse195 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse196 (bvadd .cse7 .cse13 .cse195))) (or (not (bvslt .cse4 (bvmul .cse2 .cse195))) (bvsgt .cse196 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse196))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse195 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))))) (.cse104 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse193 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse194 (bvadd .cse7 .cse13 .cse193))) (or (not (bvslt .cse4 (bvmul .cse2 .cse193))) (bvsgt .cse194 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse194))) (not (bvsgt (bvadd .cse7 .cse193 (bvneg ~last_1_var_1_14~0)) .cse6))))))) (.cse11 (and .cse55 .cse1)) (.cse119 (not .cse0)) (.cse32 (or .cse31 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse189 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse189))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse189 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse189 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse190 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse190))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse190 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvslt .cse4 (bvmul .cse190 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse191 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse191 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse191))))) (bvslt .cse4 (bvmul .cse191 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse192 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse192 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse192))))) (not (bvslt .cse4 (bvmul .cse192 c_~var_1_14~0))))))))) (.cse34 (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse188 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse188 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse188))))) (bvslt .cse4 (bvmul .cse188 c_~var_1_14~0))))))) (.cse42 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse187 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse187))))) (not (bvslt .cse4 (bvmul .cse187 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse187 (bvneg ~last_1_var_1_14~0)) .cse6))))) .cse1 .cse8)) (.cse60 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse186 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse185 (bvadd .cse7 .cse186 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse185)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse186))))) (not (bvslt .cse4 (bvmul .cse186 c_~var_1_14~0))) (not (bvsgt .cse185 .cse6)))))) .cse1 .cse8)) (.cse26 (not .cse94)) (.cse27 (not .cse184))) (and (or .cse0 (and (or (and (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse3 (bvadd .cse7 .cse5 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse3)))) (not (bvslt .cse4 (bvmul .cse5 c_~var_1_14~0))) (not (bvsgt .cse3 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse8) (or .cse1 .cse9) .cse10 (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse12 (bvadd .cse7 .cse14 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse12)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse14)))) (not (bvsgt .cse12 .cse6)) (bvslt .cse4 (bvmul .cse14 c_~var_1_14~0)) (bvsgt ~last_1_var_1_14~0 .cse7)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse15 (bvneg ~last_1_var_1_14~0)) .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse15)))) (bvslt .cse4 (bvmul .cse15 c_~var_1_14~0))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse16 (bvadd .cse7 .cse17 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse16)))) (not (bvsgt .cse16 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse17 c_~var_1_14~0)))))) .cse1 .cse8) .cse18 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse20 (bvadd .cse7 .cse19 (bvneg ~last_1_var_1_14~0)))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse19)))) (not (bvsgt .cse20 .cse6)) (bvslt .cse4 (bvmul .cse19 c_~var_1_14~0)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse20))))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse21 (bvneg ~last_1_var_1_14~0)) .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse21)))) (not (bvslt .cse4 (bvmul .cse21 c_~var_1_14~0)))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse22 (bvadd .cse7 .cse23 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse22)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse23)))) (not (bvslt .cse4 (bvmul .cse23 c_~var_1_14~0))) (not (bvsgt .cse22 .cse6)) (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse11) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse25 (bvadd .cse7 .cse24 (bvneg ~last_1_var_1_14~0)))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse24)))) (not (bvslt .cse4 (bvmul .cse24 c_~var_1_14~0))) (not (bvsgt .cse25 .cse6)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse25))))))))) .cse26 .cse27) (or (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse28)))) (not (bvslt .cse4 (bvmul .cse28 c_~var_1_14~0)))))) .cse29 .cse30) .cse31))) (or .cse0 (and .cse32 (or (let ((.cse43 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse62 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse61 (bvadd .cse7 .cse13 .cse62))) (or (bvsgt .cse61 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse61)))) (not (bvsgt (bvadd .cse7 .cse62 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse62 c_~var_1_14~0)))))))) (and (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse33 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse33))))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse33 c_~var_1_14~0)))))) .cse34 (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse35 (bvadd .cse7 .cse13 .cse37)) (.cse36 (bvadd .cse7 .cse37 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse35 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse36)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse35)))) (not (bvsgt .cse36 .cse6)) (bvslt .cse4 (bvmul .cse37 c_~var_1_14~0))))))) (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse39 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse38 (bvadd .cse7 .cse13 .cse39))) (or (not (bvsgt .cse38 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse38)))) (not (bvsgt (bvadd .cse7 .cse39 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse39 c_~var_1_14~0))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse40 (bvadd .cse7 .cse13 .cse41))) (or (bvsgt .cse40 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse40)))) (not (bvslt .cse4 (bvmul .cse41 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse41 (bvneg ~last_1_var_1_14~0)) .cse6)))))) .cse1) .cse42 (or .cse43 .cse1) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse44 (bvadd .cse7 .cse13 .cse45))) (or (bvsgt .cse44 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse44)))) (bvslt .cse4 (bvmul .cse45 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse45 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse46))))) (not (bvslt .cse4 (bvmul .cse46 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse46 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse1) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse47 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse48 (bvadd .cse7 .cse13 .cse47))) (or (bvsgt (bvadd .cse7 .cse47 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt .cse48 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse48)))) (not (bvslt .cse4 (bvmul .cse47 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse49 (bvadd .cse7 .cse13 .cse50))) (or (bvsgt .cse49 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse49)))) (not (bvslt .cse4 (bvmul .cse50 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse50 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse52 (bvadd .cse7 .cse13 .cse51))) (or (bvsgt (bvadd .cse7 .cse51 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt .cse52 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse52)))) (not (bvslt .cse4 (bvmul .cse51 c_~var_1_14~0))))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse53 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse54 (bvadd .cse7 .cse13 .cse53))) (or (bvsgt (bvadd .cse7 .cse53 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse54 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse54)))) (not (bvslt .cse4 (bvmul .cse53 c_~var_1_14~0))))))) .cse1) (or .cse43 .cse55) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse56 (bvadd .cse7 .cse13 .cse57))) (or (not (bvsgt .cse56 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse56)))) (not (bvsgt (bvadd .cse7 .cse57 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse57 c_~var_1_14~0)))))) .cse11) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse59 (bvadd .cse7 .cse13 .cse58))) (or (bvsgt (bvadd .cse7 .cse58 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse59 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse59)))) (bvslt .cse4 (bvmul .cse58 c_~var_1_14~0))))))) .cse60)) .cse26 .cse27))) (or .cse0 (and (or (let ((.cse65 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse91 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse90 (bvadd .cse7 .cse13 .cse91))) (or (bvsgt .cse90 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse90)))) (not (bvsgt (bvadd .cse7 .cse91 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse91)))))))) (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse63 (bvadd .cse7 .cse13 .cse64))) (or (not (bvsgt .cse63 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse63)))) (not (bvsgt (bvadd .cse7 .cse64 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse64)))))) .cse1 .cse8) (or .cse55 .cse65) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse67 (bvadd .cse7 .cse13 .cse66))) (or (bvsgt (bvadd .cse7 .cse66 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse67 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse67)))) (bvslt .cse4 (bvmul .cse2 .cse66)))))) .cse11) .cse68 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse70 (bvadd .cse7 .cse13 .cse69))) (or (not (bvslt .cse4 (bvmul .cse2 .cse69))) (bvsgt .cse70 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse70)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse69 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse71 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse72 (bvadd .cse7 .cse13 .cse71))) (or (bvsgt (bvadd .cse7 .cse71 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse71))) (bvsgt .cse72 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse72))))))))) (or .cse1 .cse65) .cse73 (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse75 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse74 (bvadd .cse7 .cse13 .cse75))) (or (not (bvsgt .cse74 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse74)))) (not (bvsgt (bvadd .cse7 .cse75 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse75))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse76 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse77 (bvadd .cse7 .cse13 .cse76))) (or (not (bvslt .cse4 (bvmul .cse2 .cse76))) (bvsgt .cse77 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse77)))) (not (bvsgt (bvadd .cse7 .cse76 (bvneg ~last_1_var_1_14~0)) .cse6)))))) .cse1) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse80 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse78 (bvadd .cse7 .cse13 .cse80)) (.cse79 (bvadd .cse7 .cse80 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse78 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse79)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse78)))) (not (bvsgt .cse79 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse80)))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse81 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse81 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse81))))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse81)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse83 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse82 (bvadd .cse7 .cse13 .cse83))) (or (bvsgt .cse82 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse82)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse83 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))) (bvslt .cse4 (bvmul .cse2 .cse83)))))) (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse84 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse84))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse84))))) (not (bvsgt (bvadd .cse7 .cse84 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse85 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse86 (bvadd .cse7 .cse13 .cse85))) (or (bvsgt (bvadd .cse7 .cse85 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse85))) (not (bvsgt .cse86 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse86)))))))) .cse1 .cse8) .cse87 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse88 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse89 (bvadd .cse7 .cse13 .cse88))) (or (bvsgt (bvadd .cse7 .cse88 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse88))) (not (bvsgt .cse89 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse89)))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1))) .cse26) .cse92)) (or .cse0 (and (or (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse93 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse93))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse93))))))) .cse29 .cse30) .cse94) (or (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse96 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse95 (bvadd .cse7 .cse96 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse95)))) (not (bvsgt .cse95 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse96)))))) .cse1 .cse8) .cse10 .cse97 (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse99 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse98 (bvadd .cse7 .cse99 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse98)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse99)))) (not (bvsgt .cse98 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse99)) (bvsgt ~last_1_var_1_14~0 .cse7)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse101 (bvadd .cse7 .cse100 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse100))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse101)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse100)))) (not (bvsgt .cse101 .cse6)) (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse11) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse102 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse103 (bvadd .cse7 .cse102 (bvneg ~last_1_var_1_14~0)))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse102)))) (not (bvsgt .cse103 .cse6)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse103))) (bvslt .cse4 (bvmul .cse2 .cse102))))))) (or .cse104 .cse1) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse105 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse105 (bvneg ~last_1_var_1_14~0)) .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse105)))) (bvslt .cse4 (bvmul .cse2 .cse105)))))) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse106 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse107 (bvadd .cse7 .cse106 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse106))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse106)))) (not (bvsgt .cse107 .cse6)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse107)))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse108 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse108 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse108))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse108))))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse109 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse110 (bvadd .cse7 .cse109 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse109))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse110)))) (not (bvsgt .cse110 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1 .cse8)) .cse26))) (or (and (or .cse26 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse111 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse111))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse111 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))) (bvslt .cse4 (bvmul .cse2 .cse111))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse112 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse112))))) (not (bvsgt (bvadd .cse7 .cse112 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse112))))) .cse1 .cse8) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse113 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse113))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse113)))))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse114 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse114 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse114))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse114)))))))) .cse1 .cse8) .cse68 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse115 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse115))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse115))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse115 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))) .cse73 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse117 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse116 (bvadd .cse7 .cse117 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse116)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse117))))) (not (bvsgt .cse116 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse117)))))) .cse1 .cse8) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse118 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse118))))) (bvslt .cse4 (bvmul .cse2 .cse118))))) .cse1 .cse8) .cse87)) .cse92) .cse119) (or .cse119 (and (or (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse120 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse120)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse120 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse120 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse121 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse121 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse121)))) (bvslt .cse4 (bvmul .cse121 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse122 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse122 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse122)))) (not (bvslt .cse4 (bvmul .cse122 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse123 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse123)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse123 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvslt .cse4 (bvmul .cse123 c_~var_1_14~0))))))) .cse31) (or .cse26 .cse27 (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse124 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse124 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse124) .cse6)) (not (bvslt .cse4 (bvmul .cse124 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse125 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse126 (bvadd .cse7 .cse13 .cse125))) (or (bvsgt (bvadd .cse7 .cse125 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse126 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse126))) (not (bvslt .cse4 (bvmul .cse125 c_~var_1_14~0))))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse127 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse127 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse127) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse127 c_~var_1_14~0))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse130 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse128 (bvadd .cse7 .cse13 .cse130)) (.cse129 (bvadd .cse7 .cse130 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse128 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse129)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse128))) (not (bvslt .cse4 (bvmul .cse130 c_~var_1_14~0))) (not (bvsgt .cse129 .cse6)))))) .cse1 .cse8) (or .cse1 .cse9 .cse8) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse132 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse131 (bvadd .cse7 .cse13 .cse132))) (or (bvsgt .cse131 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse131))) (bvslt .cse4 (bvmul .cse132 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse132 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) .cse18 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse133 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse134 (bvadd .cse7 .cse13 .cse133))) (or (bvsgt (bvadd .cse7 .cse133 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse134 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse134))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse133 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse137 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse135 (bvadd .cse7 .cse13 .cse137)) (.cse136 (bvadd .cse7 .cse137 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse135 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse136)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse135))) (not (bvsgt .cse136 .cse6)) (bvslt .cse4 (bvmul .cse137 c_~var_1_14~0)))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse138 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse7 .cse13 .cse138) .cse6)) (not (bvsgt (bvadd .cse7 .cse138 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse138 c_~var_1_14~0)))))) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse139 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse7 .cse13 .cse139) .cse6)) (not (bvslt .cse4 (bvmul .cse139 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse139 (bvneg ~last_1_var_1_14~0)) .cse6)))))) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse140 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse140 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse140) .cse6)) (bvslt .cse4 (bvmul .cse140 c_~var_1_14~0)) (bvsgt ~last_1_var_1_14~0 .cse7))))) (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse141 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse142 (bvadd .cse7 .cse13 .cse141))) (or (bvsgt (bvadd .cse7 .cse141 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse142 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse142))) (not (bvslt .cse4 (bvmul .cse141 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse143 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse143 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse143) .cse6)) (not (bvslt .cse4 (bvmul .cse143 c_~var_1_14~0))) (bvsgt ~last_1_var_1_14~0 .cse7))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse144 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse145 (bvadd .cse7 .cse13 .cse144))) (or (bvsgt (bvadd .cse7 .cse144 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse145 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse145))) (bvslt .cse4 (bvmul .cse144 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse147 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse146 (bvadd .cse7 .cse13 .cse147))) (or (bvsgt .cse146 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse146))) (not (bvsgt (bvadd .cse7 .cse147 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse147 c_~var_1_14~0)))))) .cse1 .cse8))))) (or (and (or .cse94 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse148 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse148))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse148)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse148 (bvneg ~last_1_var_1_14~0)) .cse6))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse149 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse149)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse149 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse149))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse150 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse150))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse150 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse150))))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse151 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse151 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse151)))) (bvslt .cse4 (bvmul .cse2 .cse151))))))) (or .cse26 (and (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse152 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse152 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse152))) (not (bvsgt (bvadd .cse7 .cse13 .cse152) .cse6)) (bvsgt ~last_1_var_1_14~0 .cse7))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse153 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse153 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse153))) (not (bvsgt (bvadd .cse7 .cse13 .cse153) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse154 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse7 .cse13 .cse154) .cse6)) (not (bvsgt (bvadd .cse7 .cse154 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse154)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse156 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse155 (bvadd .cse7 .cse13 .cse156))) (or (bvsgt .cse155 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse155))) (not (bvsgt (bvadd .cse7 .cse156 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse156)))))) .cse1 .cse8) .cse97 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse157 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse158 (bvadd .cse7 .cse13 .cse157))) (or (bvsgt (bvadd .cse7 .cse157 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse158 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse158))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse157)))))) .cse1 .cse8) (or .cse104 .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse159 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse160 (bvadd .cse7 .cse13 .cse159))) (or (bvsgt (bvadd .cse7 .cse159 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse159))) (bvsgt .cse160 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse160))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse161 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse161 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse161) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse161))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse162 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse162))) (not (bvsgt (bvadd .cse7 .cse13 .cse162) .cse6)) (not (bvsgt (bvadd .cse7 .cse162 (bvneg ~last_1_var_1_14~0)) .cse6)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse163 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse164 (bvadd .cse7 .cse13 .cse163))) (or (bvsgt (bvadd .cse7 .cse163 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse164 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse164))) (bvslt .cse4 (bvmul .cse2 .cse163)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse165 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse165 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse165) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse165)) (bvsgt ~last_1_var_1_14~0 .cse7)))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse166 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse167 (bvadd .cse7 .cse13 .cse166)) (.cse168 (bvadd .cse7 .cse166 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse166))) (bvsgt .cse167 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse168)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse167))) (not (bvsgt .cse168 .cse6)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse171 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse169 (bvadd .cse7 .cse13 .cse171)) (.cse170 (bvadd .cse7 .cse171 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse169 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse170)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse169))) (not (bvsgt .cse170 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse171)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse172 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse173 (bvadd .cse7 .cse13 .cse172))) (or (bvsgt (bvadd .cse7 .cse172 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse172))) (bvsgt .cse173 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse173))))))) .cse1 .cse8) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse175 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse174 (bvadd .cse7 .cse13 .cse175))) (or (bvsgt .cse174 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse174))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse175 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))) (bvslt .cse4 (bvmul .cse2 .cse175))))))))) .cse119) (or .cse119 (and .cse32 (or (and .cse34 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse176 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse176))))) (not (bvslt .cse4 (bvmul .cse176 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse176 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))) (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse177 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse177))))) (not (bvsgt (bvadd .cse7 .cse177 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse177 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse178 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse178))))) (bvslt .cse4 (bvmul .cse178 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse178 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))) .cse42 (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse179 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse179))))) (bvslt .cse4 (bvmul .cse179 c_~var_1_14~0))))) .cse1 .cse8) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse180 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse180))))) (not (bvslt .cse4 (bvmul .cse180 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse182 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse181 (bvadd .cse7 .cse182 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse181)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse182))))) (not (bvsgt .cse181 .cse6)) (bvslt .cse4 (bvmul .cse182 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse183 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse183 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse183))))) (not (bvslt .cse4 (bvmul .cse183 c_~var_1_14~0)))))) .cse1 .cse8) .cse60) .cse26 .cse27)))))))) is different from true [2023-12-02 16:06:47,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:06:50,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:07:30,910 WARN L293 SmtUtils]: Spent 33.65s on a formula simplification that was a NOOP. DAG size: 302 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:07:33,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:07:35,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:08:28,180 WARN L293 SmtUtils]: Spent 45.85s on a formula simplification. DAG size of input: 428 DAG size of output: 1195 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:08:30,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:08:32,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:29,483 WARN L293 SmtUtils]: Spent 48.20s on a formula simplification. DAG size of input: 432 DAG size of output: 1199 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:09:31,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:33,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:35,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:38,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:39,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:42,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:43,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:47,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:48,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:49,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:56,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:57,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:58,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:09:59,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:00,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:03,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:06,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:08,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:17,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:19,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:22,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:24,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:10:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:10:25,300 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2023-12-02 16:10:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 16:10:25,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 75 [2023-12-02 16:10:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:10:25,315 INFO L225 Difference]: With dead ends: 131 [2023-12-02 16:10:25,315 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 16:10:25,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 308.5s TimeCoverageRelationStatistics Valid=132, Invalid=439, Unknown=33, NotChecked=46, Total=650 [2023-12-02 16:10:25,316 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 91 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 106.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:10:25,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 109 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 16 Unknown, 19 Unchecked, 106.7s Time] [2023-12-02 16:10:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 16:10:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2023-12-02 16:10:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 16:10:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2023-12-02 16:10:25,388 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 75 [2023-12-02 16:10:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:10:25,389 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2023-12-02 16:10:25,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-02 16:10:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2023-12-02 16:10:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 16:10:25,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:10:25,391 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:10:25,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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)] Ended with exit code 0 [2023-12-02 16:10:25,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 16:10:25,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:10:25,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:10:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash 20908512, now seen corresponding path program 1 times [2023-12-02 16:10:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 16:10:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567510986] [2023-12-02 16:10:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:10:25,593 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 16:10:25,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 16:10:25,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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 16:10:25,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cac062c-7281-4757-b0bd-612cf9fa4bae/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)] Waiting until timeout for monitored process [2023-12-02 16:10:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:10:25,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 16:10:25,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:11:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-02 16:11:23,439 INFO L327 TraceCheckSpWp]: Computing backward predicates...