./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E --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 f77e8c9f93ca54d94eb905f2ce3291ad784a62b1b2b1f919a3731c7174a0c943 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:55:48,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:55:48,189 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:55:48,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:55:48,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:55:48,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:55:48,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:55:48,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:55:48,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:55:48,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:55:48,220 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:55:48,220 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:55:48,220 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:55:48,220 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:55:48,220 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:55:48,221 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:55:48,221 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:55:48,221 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:55:48,221 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:55:48,221 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:55:48,221 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:55:48,221 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:55:48,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:55:48,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:55:48,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:55:48,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:55:48,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:55:48,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:55:48,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:55:48,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:55:48,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:55:48,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:55:48,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:55:48,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:55:48,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:55:48,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:55:48,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:55:48,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:55:48,229 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E 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 -> f77e8c9f93ca54d94eb905f2ce3291ad784a62b1b2b1f919a3731c7174a0c943 [2024-11-14 03:55:48,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:55:48,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:55:48,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:55:48,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:55:48,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:55:48,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i Unable to find full path for "g++" [2024-11-14 03:55:50,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:55:50,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:55:50,814 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i [2024-11-14 03:55:50,828 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data/7065a3674/b277e1e870134f1dab994325f6230702/FLAG407864a6b [2024-11-14 03:55:50,849 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data/7065a3674/b277e1e870134f1dab994325f6230702 [2024-11-14 03:55:50,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:55:50,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:55:50,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:55:50,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:55:50,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:55:50,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:55:50" (1/1) ... [2024-11-14 03:55:50,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403a1ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:50, skipping insertion in model container [2024-11-14 03:55:50,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:55:50" (1/1) ... [2024-11-14 03:55:50,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:55:51,056 WARN L250 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_b56927c6-9943-4595-b22e-54262cedfc2f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i[916,929] [2024-11-14 03:55:51,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:55:51,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:55:51,184 WARN L250 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_b56927c6-9943-4595-b22e-54262cedfc2f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i[916,929] [2024-11-14 03:55:51,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:55:51,272 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:55:51,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51 WrapperNode [2024-11-14 03:55:51,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:55:51,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:55:51,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:55:51,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:55:51,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,357 INFO L138 Inliner]: procedures = 29, calls = 244, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 810 [2024-11-14 03:55:51,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:55:51,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:55:51,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:55:51,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:55:51,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:55:51,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:55:51,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:55:51,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:55:51,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (1/1) ... [2024-11-14 03:55:51,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:55:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:55:51,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:55:51,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:55:51,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:55:51,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:55:51,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 03:55:51,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 03:55:51,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:55:51,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 03:55:51,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:55:51,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:55:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:55:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:55:51,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:55:51,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:55:51,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:55:52,616 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-11-14 03:55:52,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:55:53,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:55:53,502 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:55:53,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:55:53 BoogieIcfgContainer [2024-11-14 03:55:53,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:55:53,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:55:53,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:55:53,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:55:53,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:55:50" (1/3) ... [2024-11-14 03:55:53,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28aec1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:55:53, skipping insertion in model container [2024-11-14 03:55:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:51" (2/3) ... [2024-11-14 03:55:53,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28aec1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:55:53, skipping insertion in model container [2024-11-14 03:55:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:55:53" (3/3) ... [2024-11-14 03:55:53,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-80.i [2024-11-14 03:55:53,533 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:55:53,536 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-80.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:55:53,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:55:53,613 INFO L333 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, 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;@32384d76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:55:53,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:55:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:55:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-14 03:55:53,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:53,629 INFO L215 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:55:53,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:55:53,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash 607229645, now seen corresponding path program 1 times [2024-11-14 03:55:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:53,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026502683] [2024-11-14 03:55:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 03:56:03,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177198949] [2024-11-14 03:56:03,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:03,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:03,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:03,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:56:03,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:56:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:56:04,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:56:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:56:06,696 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:56:06,698 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:56:06,699 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 03:56:06,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:56:06,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 03:56:06,906 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 03:56:07,105 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:56:07,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:56:07 BoogieIcfgContainer [2024-11-14 03:56:07,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:56:07,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:56:07,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:56:07,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:56:07,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:55:53" (3/4) ... [2024-11-14 03:56:07,118 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:56:07,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:56:07,120 INFO L158 Benchmark]: Toolchain (without parser) took 16266.92ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 94.3MB in the beginning and 314.9MB in the end (delta: -220.6MB). Peak memory consumption was 293.8MB. Max. memory is 16.1GB. [2024-11-14 03:56:07,121 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:56:07,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.53ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 78.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:56:07,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.59ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 74.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:56:07,126 INFO L158 Benchmark]: Boogie Preprocessor took 68.84ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 71.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:56:07,126 INFO L158 Benchmark]: RCFGBuilder took 2076.00ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 57.5MB in the end (delta: 13.7MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2024-11-14 03:56:07,126 INFO L158 Benchmark]: TraceAbstraction took 13607.52ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 56.7MB in the beginning and 315.0MB in the end (delta: -258.3MB). Peak memory consumption was 245.8MB. Max. memory is 16.1GB. [2024-11-14 03:56:07,127 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 629.1MB. Free memory was 315.0MB in the beginning and 314.9MB in the end (delta: 85.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:56:07,129 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.34ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.53ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 78.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.59ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 74.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.84ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 71.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2076.00ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 57.5MB in the end (delta: 13.7MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13607.52ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 56.7MB in the beginning and 315.0MB in the end (delta: -258.3MB). Peak memory consumption was 245.8MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 629.1MB. Free memory was 315.0MB in the beginning and 314.9MB in the end (delta: 85.8kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 256; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed long int var_1_8 = 128; [L25] signed long int* var_1_8_Pointer = &(var_1_8); [L26] signed short int var_1_9 = -1; [L27] signed short int* var_1_9_Pointer = &(var_1_9); [L28] signed short int var_1_10 = 1; [L29] signed short int* var_1_10_Pointer = &(var_1_10); [L30] signed char var_1_12 = 0; [L31] signed char* var_1_12_Pointer = &(var_1_12); [L32] unsigned char var_1_13 = 1; [L33] unsigned char* var_1_13_Pointer = &(var_1_13); [L34] signed char var_1_14 = 2; [L35] signed char* var_1_14_Pointer = &(var_1_14); [L36] double var_1_15 = 1.8; [L37] double* var_1_15_Pointer = &(var_1_15); [L38] double var_1_16 = 25.8; [L39] double* var_1_16_Pointer = &(var_1_16); [L40] double var_1_17 = 5.5; [L41] double* var_1_17_Pointer = &(var_1_17); [L42] double var_1_18 = 4.3; [L43] double* var_1_18_Pointer = &(var_1_18); [L44] double var_1_19 = 500.7; [L45] double* var_1_19_Pointer = &(var_1_19); [L46] double var_1_20 = 127.5; [L47] double* var_1_20_Pointer = &(var_1_20); [L48] double var_1_21 = 1.5; [L49] double* var_1_21_Pointer = &(var_1_21); [L50] double var_1_22 = 99.84; [L51] double* var_1_22_Pointer = &(var_1_22); [L52] unsigned short int var_1_23 = 4; [L53] unsigned short int* var_1_23_Pointer = &(var_1_23); [L54] signed char var_1_24 = -64; [L55] signed char* var_1_24_Pointer = &(var_1_24); [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L79] var_1_8 = __VERIFIER_nondet_long() [L80] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] var_1_9 = __VERIFIER_nondet_short() [L84] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L86] var_1_10 = __VERIFIER_nondet_short() [L87] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L89] var_1_13 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L91] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L91] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L94] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L94] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L95] var_1_16 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_16) [L96] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F [L96] EXPR \read(var_1_16) [L96] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F [L96] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L96] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L97] var_1_17 = __VERIFIER_nondet_double() [L98] EXPR \read(var_1_17) [L98] EXPR var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F [L98] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) [L98] EXPR \read(var_1_17) [L98] EXPR var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F [L98] EXPR \read(var_1_17) [L98] EXPR var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F [L98] EXPR (var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L98] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L99] var_1_18 = __VERIFIER_nondet_double() [L100] EXPR \read(var_1_18) [L100] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F [L100] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) [L100] EXPR \read(var_1_18) [L100] EXPR var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F [L100] EXPR \read(var_1_18) [L100] EXPR var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F [L100] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L100] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L100] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L101] var_1_19 = __VERIFIER_nondet_double() [L102] EXPR \read(var_1_19) [L102] EXPR var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F [L102] EXPR \read(var_1_19) [L102] EXPR var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F [L102] EXPR (var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L102] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L102] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L103] var_1_20 = __VERIFIER_nondet_double() [L104] EXPR \read(var_1_20) [L104] EXPR var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F [L104] EXPR \read(var_1_20) [L104] EXPR var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F [L104] EXPR (var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L104] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L104] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L105] var_1_21 = __VERIFIER_nondet_double() [L106] EXPR \read(var_1_21) [L106] EXPR var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F [L106] EXPR \read(var_1_21) [L106] EXPR var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F [L106] EXPR (var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L106] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) [L106] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L119] RET updateVariables() [L120] CALL step() [L59] EXPR \read(*var_1_19_Pointer) [L59] (*(var_1_22_Pointer)) = (*(var_1_19_Pointer)) [L60] EXPR \read(*var_1_10_Pointer) [L60] (*(var_1_23_Pointer)) = (*(var_1_10_Pointer)) [L61] EXPR \read(*var_1_14_Pointer) [L61] (*(var_1_24_Pointer)) = (*(var_1_14_Pointer)) [L62] EXPR \read(*var_1_23_Pointer) [L62] EXPR \read(*var_1_24_Pointer) [L62] unsigned char stepLocal_0 = (*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)); [L63] EXPR \read(*var_1_13_Pointer) [L63] COND TRUE (*(var_1_13_Pointer)) || stepLocal_0 [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR ((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))) [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR ((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))) [L64] (*(var_1_12_Pointer)) = ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))) [L68] EXPR \read(*var_1_10_Pointer) [L68] signed short int stepLocal_1 = (*(var_1_10_Pointer)); [L69] EXPR \read(*var_1_23_Pointer) [L69] EXPR \read(*var_1_8_Pointer) [L69] COND FALSE !(stepLocal_1 <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) [L72] EXPR \read(*var_1_20_Pointer) [L72] EXPR \read(*var_1_21_Pointer) [L72] (*(var_1_15_Pointer)) = ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer))) [L74] EXPR \read(*var_1_23_Pointer) [L74] EXPR \read(*var_1_23_Pointer) [L74] EXPR \read(*var_1_12_Pointer) [L74] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))) [L74] EXPR \read(*var_1_12_Pointer) [L74] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))) [L74] EXPR \read(*var_1_23_Pointer) [L74] EXPR \read(*var_1_23_Pointer) [L74] EXPR \read(*var_1_24_Pointer) [L74] EXPR \read(*var_1_8_Pointer) [L74] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer)))) [L74] EXPR \read(*var_1_24_Pointer) [L74] EXPR \read(*var_1_8_Pointer) [L74] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer)))) [L74] COND FALSE !(((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR \read(*var_1_23_Pointer) [L111] EXPR \read(*var_1_23_Pointer) [L111] EXPR \read(*var_1_12_Pointer) [L111] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))) [L111] EXPR \read(*var_1_12_Pointer) [L111] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))) [L111] EXPR \read(*var_1_23_Pointer) [L111] EXPR \read(*var_1_23_Pointer) [L111] EXPR \read(*var_1_24_Pointer) [L111] EXPR \read(*var_1_8_Pointer) [L111] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer)))) [L111] EXPR \read(*var_1_24_Pointer) [L111] EXPR \read(*var_1_8_Pointer) [L111] EXPR ((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer)))) [L111] EXPR (((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1 [L111] EXPR ((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer))))) [L111] EXPR \read(*var_1_13_Pointer) [L111] EXPR (*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer))) [L111] EXPR \read(*var_1_23_Pointer) [L111] EXPR \read(*var_1_24_Pointer) [L111] EXPR (*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer))) [L111] EXPR ((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))) [L111] EXPR \read(*var_1_12_Pointer) [L111] EXPR \read(*var_1_14_Pointer) [L111] EXPR ((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))) [L111] EXPR \read(*var_1_14_Pointer) [L111] EXPR ((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))) [L111] EXPR ((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))) [L111] EXPR ((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer))))) [L111] EXPR (((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))))) && (((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer)))))) [L111] EXPR \read(*var_1_10_Pointer) [L111] EXPR \read(*var_1_23_Pointer) [L111] EXPR \read(*var_1_8_Pointer) [L111] EXPR ((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer))))) [L111] EXPR \read(*var_1_15_Pointer) [L111] EXPR \read(*var_1_20_Pointer) [L111] EXPR \read(*var_1_21_Pointer) [L111] EXPR ((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer))))) [L111] EXPR (((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))))) && (((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer)))))) [L111] EXPR ((((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))))) && (((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer))))))) && ((*(var_1_22_Pointer)) == ((double) (*(var_1_19_Pointer)))) [L111] EXPR (((((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))))) && (((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer))))))) && ((*(var_1_22_Pointer)) == ((double) (*(var_1_19_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned short int) (*(var_1_10_Pointer)))) [L111] EXPR ((((((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))))) && (((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer))))))) && ((*(var_1_22_Pointer)) == ((double) (*(var_1_19_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned short int) (*(var_1_10_Pointer))))) && ((*(var_1_24_Pointer)) == ((signed char) (*(var_1_14_Pointer)))) [L111-L112] return ((((((((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) > ((*(var_1_12_Pointer)))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : ((*(var_1_12_Pointer))))) <= ((((((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) < (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))) ? (((*(var_1_23_Pointer)) - (*(var_1_23_Pointer)))) : (((*(var_1_24_Pointer)) % (*(var_1_8_Pointer))))))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) < ((*(var_1_12_Pointer)))) ? (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer)))) : ((*(var_1_12_Pointer))))))) : 1) && (((*(var_1_13_Pointer)) || ((*(var_1_23_Pointer)) <= (*(var_1_24_Pointer)))) ? ((*(var_1_12_Pointer)) == ((signed char) ((((1 - (*(var_1_14_Pointer))) < 0 ) ? -(1 - (*(var_1_14_Pointer))) : (1 - (*(var_1_14_Pointer))))))) : ((*(var_1_12_Pointer)) == ((signed char) (*(var_1_14_Pointer)))))) && (((*(var_1_10_Pointer)) <= ((*(var_1_23_Pointer)) / (*(var_1_8_Pointer)))) ? ((*(var_1_15_Pointer)) == ((double) (((((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) < (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer))))))) ? ((((((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) > ((*(var_1_18_Pointer)))) ? ((((((*(var_1_16_Pointer))) < ((*(var_1_17_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_17_Pointer)))))) : ((*(var_1_18_Pointer)))))) : (((((3.6) > ((*(var_1_19_Pointer)))) ? (3.6) : ((*(var_1_19_Pointer)))))))))) : ((*(var_1_15_Pointer)) == ((double) ((*(var_1_20_Pointer)) - (*(var_1_21_Pointer))))))) && ((*(var_1_22_Pointer)) == ((double) (*(var_1_19_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned short int) (*(var_1_10_Pointer))))) && ((*(var_1_24_Pointer)) == ((signed char) (*(var_1_14_Pointer)))) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_12={8:0}, var_1_12_Pointer={8:0}, var_1_13={9:0}, var_1_13_Pointer={9:0}, var_1_14={10:0}, var_1_14_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_23={19:0}, var_1_23_Pointer={19:0}, var_1_24={20:0}, var_1_24_Pointer={20:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 1, TraceHistogramMax: 17, 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=43occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 10.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 2 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 [2024-11-14 03:56:07,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E --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 f77e8c9f93ca54d94eb905f2ce3291ad784a62b1b2b1f919a3731c7174a0c943 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:56:09,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:56:10,107 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 03:56:10,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:56:10,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:56:10,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:56:10,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:56:10,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:56:10,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:56:10,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:56:10,158 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:56:10,159 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:56:10,159 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:56:10,159 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:56:10,159 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:56:10,159 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:56:10,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:56:10,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:56:10,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:56:10,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:56:10,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:56:10,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:56:10,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:56:10,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:56:10,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:56:10,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:56:10,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:56:10,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:56:10,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:56:10,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:56:10,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:56:10,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:56:10,165 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:56:10,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:56:10,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:56:10,165 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:56:10,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E 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 -> f77e8c9f93ca54d94eb905f2ce3291ad784a62b1b2b1f919a3731c7174a0c943 [2024-11-14 03:56:10,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:56:10,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:56:10,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:56:10,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:56:10,518 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:56:10,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i Unable to find full path for "g++" [2024-11-14 03:56:12,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:56:12,660 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:56:12,660 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i [2024-11-14 03:56:12,674 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data/7bcc3dac3/11d969057f6148378bcc8a2b7ed99f02/FLAG1b0d02fb5 [2024-11-14 03:56:12,940 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/data/7bcc3dac3/11d969057f6148378bcc8a2b7ed99f02 [2024-11-14 03:56:12,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:56:12,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:56:12,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:56:12,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:56:12,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:56:12,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:56:12" (1/1) ... [2024-11-14 03:56:12,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fa94e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:12, skipping insertion in model container [2024-11-14 03:56:12,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:56:12" (1/1) ... [2024-11-14 03:56:12,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:56:13,151 WARN L250 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_b56927c6-9943-4595-b22e-54262cedfc2f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i[916,929] [2024-11-14 03:56:13,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:56:13,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:56:13,282 WARN L250 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_b56927c6-9943-4595-b22e-54262cedfc2f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-80.i[916,929] [2024-11-14 03:56:13,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:56:13,350 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:56:13,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13 WrapperNode [2024-11-14 03:56:13,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:56:13,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:56:13,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:56:13,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:56:13,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,418 INFO L138 Inliner]: procedures = 36, calls = 244, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 806 [2024-11-14 03:56:13,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:56:13,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:56:13,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:56:13,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:56:13,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:56:13,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:56:13,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:56:13,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:56:13,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (1/1) ... [2024-11-14 03:56:13,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:56:13,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:13,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:56:13,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:56:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 03:56:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:56:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:56:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:56:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:56:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 03:56:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 03:56:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:56:13,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:56:13,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:56:15,730 INFO L? ?]: Removed 259 outVars from TransFormulas that were not future-live. [2024-11-14 03:56:15,730 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:56:15,743 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:56:15,743 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:56:15,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:56:15 BoogieIcfgContainer [2024-11-14 03:56:15,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:56:15,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:56:15,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:56:15,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:56:15,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:56:12" (1/3) ... [2024-11-14 03:56:15,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5880b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:56:15, skipping insertion in model container [2024-11-14 03:56:15,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:13" (2/3) ... [2024-11-14 03:56:15,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5880b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:56:15, skipping insertion in model container [2024-11-14 03:56:15,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:56:15" (3/3) ... [2024-11-14 03:56:15,754 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-80.i [2024-11-14 03:56:15,770 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:56:15,773 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-80.i that has 2 procedures, 154 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:56:15,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:56:15,863 INFO L333 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, 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;@512039ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:56:15,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:56:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-14 03:56:15,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:15,886 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:15,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:15,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash -236521488, now seen corresponding path program 1 times [2024-11-14 03:56:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565845910] [2024-11-14 03:56:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:15,912 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 [2024-11-14 03:56:15,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:15,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:15,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:16,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 03:56:16,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-14 03:56:16,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:16,773 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565845910] [2024-11-14 03:56:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565845910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:16,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:16,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:56:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231719329] [2024-11-14 03:56:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:16,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:56:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:56:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:56:16,809 INFO L87 Difference]: Start difference. First operand has 154 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:16,856 INFO L93 Difference]: Finished difference Result 301 states and 469 transitions. [2024-11-14 03:56:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:56:16,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2024-11-14 03:56:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:16,870 INFO L225 Difference]: With dead ends: 301 [2024-11-14 03:56:16,871 INFO L226 Difference]: Without dead ends: 150 [2024-11-14 03:56:16,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:56:16,882 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:16,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:56:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-14 03:56:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-14 03:56:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2024-11-14 03:56:16,943 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 153 [2024-11-14 03:56:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:16,944 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2024-11-14 03:56:16,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2024-11-14 03:56:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-14 03:56:16,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:16,948 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:16,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 03:56:17,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:17,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:17,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -20923046, now seen corresponding path program 1 times [2024-11-14 03:56:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280292121] [2024-11-14 03:56:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:17,152 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 [2024-11-14 03:56:17,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:17,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:17,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:17,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:56:17,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-14 03:56:18,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:18,025 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:18,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280292121] [2024-11-14 03:56:18,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280292121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:18,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:18,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:56:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723095526] [2024-11-14 03:56:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:18,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:56:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:18,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:56:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:18,032 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:18,204 INFO L93 Difference]: Finished difference Result 299 states and 444 transitions. [2024-11-14 03:56:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:56:18,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2024-11-14 03:56:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:18,208 INFO L225 Difference]: With dead ends: 299 [2024-11-14 03:56:18,208 INFO L226 Difference]: Without dead ends: 152 [2024-11-14 03:56:18,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:18,210 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:18,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:56:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-14 03:56:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-14 03:56:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-11-14 03:56:18,223 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 153 [2024-11-14 03:56:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:18,225 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-11-14 03:56:18,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-11-14 03:56:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-14 03:56:18,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:18,231 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:18,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:18,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:18,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1587680996, now seen corresponding path program 1 times [2024-11-14 03:56:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348236890] [2024-11-14 03:56:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:18,434 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 [2024-11-14 03:56:18,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:18,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:18,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:19,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:56:19,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:56:19,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:19,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348236890] [2024-11-14 03:56:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348236890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:19,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:19,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:56:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672372834] [2024-11-14 03:56:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:56:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:56:19,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:19,310 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:19,384 INFO L93 Difference]: Finished difference Result 303 states and 448 transitions. [2024-11-14 03:56:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:56:19,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2024-11-14 03:56:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:19,390 INFO L225 Difference]: With dead ends: 303 [2024-11-14 03:56:19,390 INFO L226 Difference]: Without dead ends: 154 [2024-11-14 03:56:19,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:19,396 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:19,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:56:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-14 03:56:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-14 03:56:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2024-11-14 03:56:19,417 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 153 [2024-11-14 03:56:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:19,419 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2024-11-14 03:56:19,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2024-11-14 03:56:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-14 03:56:19,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:19,425 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:19,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-14 03:56:19,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:19,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -855052425, now seen corresponding path program 1 times [2024-11-14 03:56:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463071768] [2024-11-14 03:56:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:19,627 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 [2024-11-14 03:56:19,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:19,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:19,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:20,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:56:20,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:56:20,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:20,473 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463071768] [2024-11-14 03:56:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463071768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:20,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:56:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981287814] [2024-11-14 03:56:20,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:20,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:56:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:20,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:56:20,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:56:20,476 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:20,584 INFO L93 Difference]: Finished difference Result 310 states and 456 transitions. [2024-11-14 03:56:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:56:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-14 03:56:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:20,589 INFO L225 Difference]: With dead ends: 310 [2024-11-14 03:56:20,590 INFO L226 Difference]: Without dead ends: 159 [2024-11-14 03:56:20,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:56:20,592 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:20,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 852 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:56:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-14 03:56:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-14 03:56:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.410071942446043) internal successors, (196), 139 states have internal predecessors, (196), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-14 03:56:20,615 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 155 [2024-11-14 03:56:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:20,616 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-14 03:56:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-11-14 03:56:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-14 03:56:20,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:20,618 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:20,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:20,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:20,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:20,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash -174994055, now seen corresponding path program 1 times [2024-11-14 03:56:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958321456] [2024-11-14 03:56:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:20,822 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 [2024-11-14 03:56:20,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:20,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:20,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:21,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:56:21,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:56:21,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:21,659 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958321456] [2024-11-14 03:56:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958321456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:21,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:56:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14258851] [2024-11-14 03:56:21,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:21,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:56:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:56:21,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:56:21,661 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:21,791 INFO L93 Difference]: Finished difference Result 316 states and 461 transitions. [2024-11-14 03:56:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:56:21,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-14 03:56:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:21,794 INFO L225 Difference]: With dead ends: 316 [2024-11-14 03:56:21,794 INFO L226 Difference]: Without dead ends: 161 [2024-11-14 03:56:21,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:56:21,796 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:21,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1055 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:56:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-14 03:56:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2024-11-14 03:56:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 141 states have internal predecessors, (198), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-14 03:56:21,807 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 155 [2024-11-14 03:56:21,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:21,808 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-14 03:56:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-14 03:56:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-14 03:56:21,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:21,811 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:21,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 03:56:22,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:22,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:22,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1600013307, now seen corresponding path program 1 times [2024-11-14 03:56:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:22,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450189087] [2024-11-14 03:56:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:22,013 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 [2024-11-14 03:56:22,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:22,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:22,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:22,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:56:22,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:56:22,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:22,861 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450189087] [2024-11-14 03:56:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450189087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:56:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617984663] [2024-11-14 03:56:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:56:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:56:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:56:22,862 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:23,004 INFO L93 Difference]: Finished difference Result 320 states and 465 transitions. [2024-11-14 03:56:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:56:23,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-14 03:56:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:23,006 INFO L225 Difference]: With dead ends: 320 [2024-11-14 03:56:23,006 INFO L226 Difference]: Without dead ends: 163 [2024-11-14 03:56:23,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:56:23,009 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:23,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1259 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:56:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-14 03:56:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-14 03:56:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3986013986013985) internal successors, (200), 143 states have internal predecessors, (200), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2024-11-14 03:56:23,027 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 155 [2024-11-14 03:56:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:23,028 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2024-11-14 03:56:23,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2024-11-14 03:56:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-14 03:56:23,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:23,034 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:23,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:23,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:23,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:23,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1601860349, now seen corresponding path program 1 times [2024-11-14 03:56:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264778799] [2024-11-14 03:56:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:23,236 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 [2024-11-14 03:56:23,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:23,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:23,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:24,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:56:24,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:24,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:24,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-14 03:56:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-14 03:56:24,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:24,664 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:24,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264778799] [2024-11-14 03:56:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264778799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:24,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:56:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549460478] [2024-11-14 03:56:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:56:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:56:24,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:56:24,667 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:27,062 INFO L93 Difference]: Finished difference Result 322 states and 466 transitions. [2024-11-14 03:56:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:56:27,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2024-11-14 03:56:27,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:27,065 INFO L225 Difference]: With dead ends: 322 [2024-11-14 03:56:27,065 INFO L226 Difference]: Without dead ends: 163 [2024-11-14 03:56:27,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:56:27,066 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 156 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:27,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 616 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 03:56:27,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-14 03:56:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-14 03:56:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3916083916083917) internal successors, (199), 143 states have internal predecessors, (199), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 233 transitions. [2024-11-14 03:56:27,076 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 233 transitions. Word has length 155 [2024-11-14 03:56:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:27,077 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 233 transitions. [2024-11-14 03:56:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions. [2024-11-14 03:56:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-14 03:56:27,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:27,079 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:27,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 03:56:27,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:27,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:27,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1594559657, now seen corresponding path program 1 times [2024-11-14 03:56:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111968605] [2024-11-14 03:56:27,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:27,282 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 [2024-11-14 03:56:27,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:27,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:27,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (9)] Waiting until timeout for monitored process [2024-11-14 03:56:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:28,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:56:28,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:28,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:28,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-14 03:56:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-14 03:56:28,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:28,646 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111968605] [2024-11-14 03:56:28,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111968605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:28,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:28,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:56:28,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368377677] [2024-11-14 03:56:28,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:28,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:56:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:28,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:56:28,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:56:28,648 INFO L87 Difference]: Start difference. First operand 162 states and 233 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:31,196 INFO L93 Difference]: Finished difference Result 322 states and 464 transitions. [2024-11-14 03:56:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:56:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2024-11-14 03:56:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:31,200 INFO L225 Difference]: With dead ends: 322 [2024-11-14 03:56:31,200 INFO L226 Difference]: Without dead ends: 163 [2024-11-14 03:56:31,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:56:31,201 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 148 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:31,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 609 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:56:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-14 03:56:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-14 03:56:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3846153846153846) internal successors, (198), 143 states have internal predecessors, (198), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 232 transitions. [2024-11-14 03:56:31,213 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 232 transitions. Word has length 157 [2024-11-14 03:56:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:31,213 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 232 transitions. [2024-11-14 03:56:31,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-14 03:56:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 232 transitions. [2024-11-14 03:56:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:56:31,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:31,216 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:31,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (9)] Ended with exit code 0 [2024-11-14 03:56:31,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:31,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:31,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:31,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1946558275, now seen corresponding path program 1 times [2024-11-14 03:56:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062588729] [2024-11-14 03:56:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:31,418 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 [2024-11-14 03:56:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:31,421 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:31,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 03:56:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:32,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 03:56:32,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:34,242 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 03:56:34,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2024-11-14 03:56:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:56:34,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:34,265 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062588729] [2024-11-14 03:56:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062588729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:56:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985438690] [2024-11-14 03:56:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:34,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:56:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:56:34,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:56:34,267 INFO L87 Difference]: Start difference. First operand 162 states and 232 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:46,965 INFO L93 Difference]: Finished difference Result 387 states and 554 transitions. [2024-11-14 03:56:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:56:46,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:56:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:46,972 INFO L225 Difference]: With dead ends: 387 [2024-11-14 03:56:46,973 INFO L226 Difference]: Without dead ends: 228 [2024-11-14 03:56:46,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:56:46,974 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 75 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:46,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 580 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-14 03:56:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-14 03:56:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 169. [2024-11-14 03:56:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 150 states have (on average 1.3866666666666667) internal successors, (208), 150 states have internal predecessors, (208), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:56:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 242 transitions. [2024-11-14 03:56:46,984 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 242 transitions. Word has length 159 [2024-11-14 03:56:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:46,984 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 242 transitions. [2024-11-14 03:56:46,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:56:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 242 transitions. [2024-11-14 03:56:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:56:46,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:46,987 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:47,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 03:56:47,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:56:47,188 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:47,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash 354264315, now seen corresponding path program 1 times [2024-11-14 03:56:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:56:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422084225] [2024-11-14 03:56:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:47,189 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 [2024-11-14 03:56:47,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:56:47,191 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:56:47,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 03:56:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:47,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 03:56:47,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:49,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:49,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 69 [2024-11-14 03:56:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:56:49,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:56:49,961 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:56:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422084225] [2024-11-14 03:56:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422084225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:49,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:56:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675728841] [2024-11-14 03:56:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:56:49,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:56:49,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:56:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:56:49,963 INFO L87 Difference]: Start difference. First operand 169 states and 242 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:05,289 INFO L93 Difference]: Finished difference Result 394 states and 563 transitions. [2024-11-14 03:57:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:57:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:57:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:05,295 INFO L225 Difference]: With dead ends: 394 [2024-11-14 03:57:05,295 INFO L226 Difference]: Without dead ends: 228 [2024-11-14 03:57:05,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:57:05,296 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 73 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:05,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 753 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-11-14 03:57:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-14 03:57:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 170. [2024-11-14 03:57:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 151 states have internal predecessors, (209), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:57:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 243 transitions. [2024-11-14 03:57:05,306 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 243 transitions. Word has length 159 [2024-11-14 03:57:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:05,306 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 243 transitions. [2024-11-14 03:57:05,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 243 transitions. [2024-11-14 03:57:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:57:05,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:05,309 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:05,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:05,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:57:05,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:57:05,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1530760571, now seen corresponding path program 1 times [2024-11-14 03:57:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630827138] [2024-11-14 03:57:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:05,511 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 [2024-11-14 03:57:05,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:05,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:57:05,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-14 03:57:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:06,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:57:06,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:09,272 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2024-11-14 03:57:09,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 58 [2024-11-14 03:57:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:57:09,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:09,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630827138] [2024-11-14 03:57:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630827138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:09,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:57:09,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010641678] [2024-11-14 03:57:09,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:57:09,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:57:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:57:09,289 INFO L87 Difference]: Start difference. First operand 170 states and 243 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:29,737 INFO L93 Difference]: Finished difference Result 395 states and 563 transitions. [2024-11-14 03:57:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:57:29,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:57:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:29,742 INFO L225 Difference]: With dead ends: 395 [2024-11-14 03:57:29,742 INFO L226 Difference]: Without dead ends: 228 [2024-11-14 03:57:29,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:57:29,743 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 72 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:29,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 789 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 19.3s Time] [2024-11-14 03:57:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-14 03:57:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 172. [2024-11-14 03:57:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 153 states have internal predecessors, (211), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:57:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2024-11-14 03:57:29,751 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 159 [2024-11-14 03:57:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:29,752 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2024-11-14 03:57:29,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2024-11-14 03:57:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:57:29,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:29,754 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:29,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:29,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:57:29,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:57:29,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:29,955 INFO L85 PathProgramCache]: Analyzing trace with hash -463384135, now seen corresponding path program 1 times [2024-11-14 03:57:29,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:29,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630720109] [2024-11-14 03:57:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:29,956 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 [2024-11-14 03:57:29,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:29,957 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:57:29,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 03:57:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:30,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:57:30,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:57:33,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:33,062 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:33,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630720109] [2024-11-14 03:57:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630720109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:33,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:33,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:57:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931511895] [2024-11-14 03:57:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:33,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:57:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:57:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:57:33,064 INFO L87 Difference]: Start difference. First operand 172 states and 245 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:45,861 INFO L93 Difference]: Finished difference Result 388 states and 552 transitions. [2024-11-14 03:57:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:57:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:57:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:45,871 INFO L225 Difference]: With dead ends: 388 [2024-11-14 03:57:45,871 INFO L226 Difference]: Without dead ends: 219 [2024-11-14 03:57:45,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:57:45,872 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 63 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:45,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 650 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2024-11-14 03:57:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-14 03:57:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 170. [2024-11-14 03:57:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.3774834437086092) internal successors, (208), 151 states have internal predecessors, (208), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:57:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 242 transitions. [2024-11-14 03:57:45,889 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 242 transitions. Word has length 159 [2024-11-14 03:57:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:45,891 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 242 transitions. [2024-11-14 03:57:45,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 242 transitions. [2024-11-14 03:57:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:57:45,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:45,892 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:45,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 03:57:46,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:57:46,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:57:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -141119941, now seen corresponding path program 1 times [2024-11-14 03:57:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:46,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027726586] [2024-11-14 03:57:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:46,094 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 [2024-11-14 03:57:46,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:46,096 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:57:46,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 03:57:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:46,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 03:57:46,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:57:46,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:46,855 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027726586] [2024-11-14 03:57:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027726586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:46,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:46,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:57:46,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944476478] [2024-11-14 03:57:46,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:46,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:57:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:57:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:57:46,857 INFO L87 Difference]: Start difference. First operand 170 states and 242 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:50,185 INFO L93 Difference]: Finished difference Result 338 states and 483 transitions. [2024-11-14 03:57:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:57:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:57:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:50,188 INFO L225 Difference]: With dead ends: 338 [2024-11-14 03:57:50,188 INFO L226 Difference]: Without dead ends: 171 [2024-11-14 03:57:50,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:57:50,189 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:50,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 423 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 03:57:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-14 03:57:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-14 03:57:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 152 states have (on average 1.375) internal successors, (209), 152 states have internal predecessors, (209), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:57:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 243 transitions. [2024-11-14 03:57:50,197 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 243 transitions. Word has length 159 [2024-11-14 03:57:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:50,209 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 243 transitions. [2024-11-14 03:57:50,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 243 transitions. [2024-11-14 03:57:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:57:50,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:50,210 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:50,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-14 03:57:50,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:57:50,411 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:57:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1806009665, now seen corresponding path program 1 times [2024-11-14 03:57:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:57:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11935589] [2024-11-14 03:57:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:50,412 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 [2024-11-14 03:57:50,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:57:50,414 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:57:50,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (15)] Waiting until timeout for monitored process [2024-11-14 03:57:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:51,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:57:51,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:57:52,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:57:52,591 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11935589] [2024-11-14 03:57:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11935589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:52,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:52,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:57:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545586052] [2024-11-14 03:57:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:52,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:57:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:57:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:57:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:57:52,593 INFO L87 Difference]: Start difference. First operand 171 states and 243 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:57:57,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:58:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:05,932 INFO L93 Difference]: Finished difference Result 399 states and 566 transitions. [2024-11-14 03:58:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:58:05,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:58:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:05,938 INFO L225 Difference]: With dead ends: 399 [2024-11-14 03:58:05,938 INFO L226 Difference]: Without dead ends: 231 [2024-11-14 03:58:05,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:58:05,939 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 72 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:05,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 678 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2024-11-14 03:58:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-14 03:58:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 174. [2024-11-14 03:58:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 155 states have internal predecessors, (213), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:58:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2024-11-14 03:58:05,958 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 159 [2024-11-14 03:58:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:05,959 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2024-11-14 03:58:05,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:58:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2024-11-14 03:58:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:58:05,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:05,961 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:05,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (15)] Forceful destruction successful, exit code 0 [2024-11-14 03:58:06,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:58:06,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:58:06,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1671309181, now seen corresponding path program 1 times [2024-11-14 03:58:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798399385] [2024-11-14 03:58:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:06,162 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 [2024-11-14 03:58:06,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:06,164 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:58:06,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (16)] Waiting until timeout for monitored process [2024-11-14 03:58:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:06,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 03:58:06,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:58:09,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:09,311 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:09,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798399385] [2024-11-14 03:58:09,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798399385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:09,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:58:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907445570] [2024-11-14 03:58:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:09,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:58:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:58:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:58:09,313 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:58:20,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:58:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:31,044 INFO L93 Difference]: Finished difference Result 402 states and 569 transitions. [2024-11-14 03:58:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:58:31,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:58:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:31,050 INFO L225 Difference]: With dead ends: 402 [2024-11-14 03:58:31,050 INFO L226 Difference]: Without dead ends: 231 [2024-11-14 03:58:31,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:58:31,051 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 72 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:31,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 790 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2024-11-14 03:58:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-14 03:58:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 176. [2024-11-14 03:58:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3694267515923566) internal successors, (215), 157 states have internal predecessors, (215), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:58:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 249 transitions. [2024-11-14 03:58:31,059 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 249 transitions. Word has length 159 [2024-11-14 03:58:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:31,059 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 249 transitions. [2024-11-14 03:58:31,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:58:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 249 transitions. [2024-11-14 03:58:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:58:31,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:31,061 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:31,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (16)] Ended with exit code 0 [2024-11-14 03:58:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:58:31,262 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:58:31,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash -322835525, now seen corresponding path program 1 times [2024-11-14 03:58:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149952577] [2024-11-14 03:58:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:31,264 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 [2024-11-14 03:58:31,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:31,267 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:58:31,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (17)] Waiting until timeout for monitored process [2024-11-14 03:58:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:32,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:58:32,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:35,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:58:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 123 [2024-11-14 03:58:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:58:37,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:37,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:37,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149952577] [2024-11-14 03:58:37,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149952577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:37,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:37,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:58:37,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223941054] [2024-11-14 03:58:37,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:37,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:58:37,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:58:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:58:37,032 INFO L87 Difference]: Start difference. First operand 176 states and 249 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:02,433 INFO L93 Difference]: Finished difference Result 398 states and 562 transitions. [2024-11-14 03:59:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:59:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:59:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:02,439 INFO L225 Difference]: With dead ends: 398 [2024-11-14 03:59:02,439 INFO L226 Difference]: Without dead ends: 225 [2024-11-14 03:59:02,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:59:02,441 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 66 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:02,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 963 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 23.6s Time] [2024-11-14 03:59:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-14 03:59:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 174. [2024-11-14 03:59:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 155 states have internal predecessors, (213), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:59:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2024-11-14 03:59:02,450 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 159 [2024-11-14 03:59:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:02,450 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2024-11-14 03:59:02,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2024-11-14 03:59:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:59:02,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:02,452 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:02,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (17)] Ended with exit code 0 [2024-11-14 03:59:02,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:59:02,653 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:59:02,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash -571331, now seen corresponding path program 1 times [2024-11-14 03:59:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812379822] [2024-11-14 03:59:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:02,655 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 [2024-11-14 03:59:02,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:02,658 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:59:02,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (18)] Waiting until timeout for monitored process [2024-11-14 03:59:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:03,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:59:03,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:03,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:03,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 38 [2024-11-14 03:59:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:59:03,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:03,849 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812379822] [2024-11-14 03:59:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812379822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:03,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:59:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749080442] [2024-11-14 03:59:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:03,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:59:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:59:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:59:03,851 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:10,795 INFO L93 Difference]: Finished difference Result 404 states and 572 transitions. [2024-11-14 03:59:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:59:10,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:59:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:10,799 INFO L225 Difference]: With dead ends: 404 [2024-11-14 03:59:10,800 INFO L226 Difference]: Without dead ends: 233 [2024-11-14 03:59:10,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:59:10,801 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 70 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:10,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 910 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-14 03:59:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-14 03:59:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 176. [2024-11-14 03:59:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3694267515923566) internal successors, (215), 157 states have internal predecessors, (215), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:59:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 249 transitions. [2024-11-14 03:59:10,811 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 249 transitions. Word has length 159 [2024-11-14 03:59:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:10,811 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 249 transitions. [2024-11-14 03:59:10,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 249 transitions. [2024-11-14 03:59:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:59:10,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:10,814 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:10,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (18)] Forceful destruction successful, exit code 0 [2024-11-14 03:59:11,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:59:11,015 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:59:11,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash -818219781, now seen corresponding path program 1 times [2024-11-14 03:59:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769740683] [2024-11-14 03:59:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:11,017 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 [2024-11-14 03:59:11,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:11,021 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:59:11,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (19)] Waiting until timeout for monitored process [2024-11-14 03:59:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:11,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:59:11,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:12,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:12,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2024-11-14 03:59:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:59:12,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:12,161 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769740683] [2024-11-14 03:59:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769740683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:59:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636023102] [2024-11-14 03:59:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:12,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:59:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:59:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:59:12,163 INFO L87 Difference]: Start difference. First operand 176 states and 249 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:16,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:21,007 INFO L93 Difference]: Finished difference Result 407 states and 575 transitions. [2024-11-14 03:59:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:59:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:59:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:21,010 INFO L225 Difference]: With dead ends: 407 [2024-11-14 03:59:21,010 INFO L226 Difference]: Without dead ends: 234 [2024-11-14 03:59:21,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:59:21,011 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 72 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:21,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 905 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-14 03:59:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-14 03:59:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2024-11-14 03:59:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.371069182389937) internal successors, (218), 159 states have internal predecessors, (218), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:59:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2024-11-14 03:59:21,026 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 159 [2024-11-14 03:59:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:21,027 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2024-11-14 03:59:21,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2024-11-14 03:59:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-14 03:59:21,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:21,029 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:21,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (19)] Ended with exit code 0 [2024-11-14 03:59:21,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:59:21,229 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:59:21,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:21,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1482602809, now seen corresponding path program 1 times [2024-11-14 03:59:21,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:21,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657090539] [2024-11-14 03:59:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:21,230 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 [2024-11-14 03:59:21,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:21,232 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:59:21,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (20)] Waiting until timeout for monitored process [2024-11-14 03:59:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:22,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:59:22,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:59:25,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:25,299 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657090539] [2024-11-14 03:59:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657090539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:25,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:25,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:59:25,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363695410] [2024-11-14 03:59:25,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:25,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:59:25,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:25,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:59:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:59:25,300 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:45,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:46,404 INFO L93 Difference]: Finished difference Result 402 states and 567 transitions. [2024-11-14 03:59:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:59:46,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-14 03:59:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:46,414 INFO L225 Difference]: With dead ends: 402 [2024-11-14 03:59:46,414 INFO L226 Difference]: Without dead ends: 227 [2024-11-14 03:59:46,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:59:46,415 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 64 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:46,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 865 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 1 Unknown, 0 Unchecked, 18.4s Time] [2024-11-14 03:59:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-14 03:59:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2024-11-14 03:59:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:59:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2024-11-14 03:59:46,423 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 159 [2024-11-14 03:59:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:46,423 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2024-11-14 03:59:46,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2024-11-14 03:59:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-14 03:59:46,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:46,425 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:46,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (20)] Forceful destruction successful, exit code 0 [2024-11-14 03:59:46,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:59:46,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:59:46,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 917647763, now seen corresponding path program 1 times [2024-11-14 03:59:46,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:46,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893627955] [2024-11-14 03:59:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:46,627 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 [2024-11-14 03:59:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:46,631 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:59:46,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (21)] Waiting until timeout for monitored process [2024-11-14 03:59:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:47,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:59:47,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 03:59:47,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:59:47,443 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:59:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893627955] [2024-11-14 03:59:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893627955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:59:47,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:59:47,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:59:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882255157] [2024-11-14 03:59:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:59:47,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:59:47,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:59:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:59:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:59:47,445 INFO L87 Difference]: Start difference. First operand 178 states and 251 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:47,497 INFO L93 Difference]: Finished difference Result 354 states and 501 transitions. [2024-11-14 03:59:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:59:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-14 03:59:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:47,499 INFO L225 Difference]: With dead ends: 354 [2024-11-14 03:59:47,499 INFO L226 Difference]: Without dead ends: 179 [2024-11-14 03:59:47,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:59:47,500 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:47,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:59:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-14 03:59:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-14 03:59:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 160 states have (on average 1.3625) internal successors, (218), 160 states have internal predecessors, (218), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 03:59:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2024-11-14 03:59:47,508 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 160 [2024-11-14 03:59:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:47,508 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2024-11-14 03:59:47,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 03:59:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2024-11-14 03:59:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-14 03:59:47,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:47,510 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:47,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (21)] Ended with exit code 0 [2024-11-14 03:59:47,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 03:59:47,710 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:59:47,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash -362215915, now seen corresponding path program 1 times [2024-11-14 03:59:47,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:59:47,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747392733] [2024-11-14 03:59:47,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:47,712 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 [2024-11-14 03:59:47,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:59:47,713 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 03:59:47,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (22)] Waiting until timeout for monitored process [2024-11-14 03:59:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:49,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 03:59:49,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:56,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:59:59,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:00:02,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:00:05,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:00:07,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:00:08,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:00:10,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:00:11,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:00:12,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:00:14,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2024-11-14 04:00:14,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:00:14,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:00:14,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2024-11-14 04:00:15,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 79 [2024-11-14 04:00:15,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 46 [2024-11-14 04:00:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 2 proven. 498 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-14 04:00:16,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:00:28,529 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_12_Pointer~0.offset (_ BitVec 32)) (~var_1_24_Pointer~0.offset (_ BitVec 32)) (~var_1_23_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_856 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| c_~var_1_22_Pointer~0.base v_ArrVal_850))) (store .cse5 c_~var_1_23_Pointer~0.base (store (select .cse5 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse5 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset)))))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset))))) (let ((.cse2 (store .cse4 c_~var_1_24_Pointer~0.base (store (select .cse4 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset .cse3)))) (or (not (let ((.cse1 (store (store .cse2 c_~var_1_12_Pointer~0.base (store (select .cse2 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset))))) c_~var_1_15_Pointer~0.base v_ArrVal_856))) (bvsgt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))))) (bvadd .cse0 (bvneg .cse0))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) .cse3)))))))) is different from false [2024-11-14 04:00:29,074 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:00:29,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747392733] [2024-11-14 04:00:29,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747392733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:00:29,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1192530217] [2024-11-14 04:00:29,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:29,075 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:00:29,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:00:29,077 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:00:29,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-14 04:00:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:33,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:00:33,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:00:36,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-14 04:00:36,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-14 04:00:37,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-11-14 04:00:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 04:00:38,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:00:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1192530217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:00:38,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:00:38,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 29 [2024-11-14 04:00:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277215999] [2024-11-14 04:00:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:00:38,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:00:38,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:00:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:00:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=967, Unknown=25, NotChecked=64, Total=1190 [2024-11-14 04:00:38,158 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 04:00:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:00:44,858 INFO L93 Difference]: Finished difference Result 449 states and 630 transitions. [2024-11-14 04:00:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:00:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-14 04:00:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:00:44,860 INFO L225 Difference]: With dead ends: 449 [2024-11-14 04:00:44,860 INFO L226 Difference]: Without dead ends: 273 [2024-11-14 04:00:44,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=152, Invalid=1159, Unknown=25, NotChecked=70, Total=1406 [2024-11-14 04:00:44,862 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 333 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:00:44,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 667 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-14 04:00:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-14 04:00:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2024-11-14 04:00:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 206 states have (on average 1.3689320388349515) internal successors, (282), 206 states have internal predecessors, (282), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 04:00:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2024-11-14 04:00:44,874 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 160 [2024-11-14 04:00:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:00:44,875 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2024-11-14 04:00:44,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 04:00:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2024-11-14 04:00:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-14 04:00:44,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:00:44,876 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:00:44,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-14 04:00:45,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (22)] Ended with exit code 0 [2024-11-14 04:00:45,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 04:00:45,277 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:00:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:00:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1261381666, now seen corresponding path program 1 times [2024-11-14 04:00:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:00:45,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765561043] [2024-11-14 04:00:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:45,278 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 [2024-11-14 04:00:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:00:45,280 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:00:45,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (24)] Waiting until timeout for monitored process [2024-11-14 04:00:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:46,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-14 04:00:46,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:00:53,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:00:56,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:01:00,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:01:03,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:01:06,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:01:08,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:01:10,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:01:12,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:01:13,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:01:15,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:01:16,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2024-11-14 04:01:16,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:01:17,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-14 04:01:17,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2024-11-14 04:01:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 2 proven. 522 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-14 04:01:18,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:21,755 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_957))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_24_Pointer~0.base) c_~var_1_24_Pointer~0.offset))) (select (select .cse1 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset)))))) is different from false [2024-11-14 04:01:25,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_24_Pointer~0.offset (_ BitVec 32))) (or (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select |c_#memory_int| c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))) (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_957))) (bvslt (let ((.cse1 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse1) .cse1)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select .cse2 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset)))))))) is different from false [2024-11-14 04:01:30,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_24_Pointer~0.offset (_ BitVec 32))) (let ((.cse1 (store |c_#memory_int| c_~var_1_15_Pointer~0.base v_ArrVal_956))) (let ((.cse0 (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse4) .cse4)))) (or (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))) (bvslt .cse0 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select .cse1 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))) (not (let ((.cse3 (store .cse1 c_~var_1_1_Pointer~0.base v_ArrVal_957))) (bvslt (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd .cse2 (bvneg .cse2))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select .cse3 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))))))))) is different from false [2024-11-14 04:01:32,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_24_Pointer~0.offset (_ BitVec 32))) (let ((.cse1 (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset))))) c_~var_1_15_Pointer~0.base v_ArrVal_956))) (let ((.cse0 (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd .cse4 (bvneg .cse4))))) (or (bvslt .cse0 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select .cse1 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))) (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))))) (not (let ((.cse3 (store .cse1 c_~var_1_1_Pointer~0.base v_ArrVal_957))) (bvslt (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd .cse2 (bvneg .cse2))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select .cse3 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))))))))) is different from false [2024-11-14 04:01:34,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_24_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_23_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (store (let ((.cse5 (store (let ((.cse6 (store |c_#memory_int| c_~var_1_22_Pointer~0.base v_ArrVal_953))) (store .cse6 c_~var_1_23_Pointer~0.base (store (select .cse6 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse6 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset)))))) c_~var_1_24_Pointer~0.base v_ArrVal_951))) (store .cse5 c_~var_1_12_Pointer~0.base (store (select .cse5 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset)))))) c_~var_1_15_Pointer~0.base v_ArrVal_956))) (let ((.cse3 (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse4) .cse4)))) (or (not (let ((.cse1 (store .cse2 c_~var_1_1_Pointer~0.base v_ArrVal_957))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select .cse1 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))))) (not (bvsgt .cse3 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))))) (bvslt .cse3 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) (select (select .cse2 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset))))))) is different from false [2024-11-14 04:01:39,177 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765561043] [2024-11-14 04:01:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765561043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:01:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [689640582] [2024-11-14 04:01:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:39,177 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:39,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:39,179 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:39,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-14 04:01:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:43,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 04:01:43,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:52,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-14 04:02:00,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:04,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:08,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:11,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:13,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:16,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:18,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:21,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 04:02:23,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2024-11-14 04:02:23,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:02:23,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:02:25,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2024-11-14 04:02:26,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2024-11-14 04:02:31,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2024-11-14 04:02:34,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2024-11-14 04:02:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 1 proven. 495 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-14 04:02:36,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:31,373 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1016 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_24_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_property_#t~mem150#1| (_ BitVec 32)) (~var_1_23_Pointer~0.offset (_ BitVec 32))) (let ((.cse7 (let ((.cse8 (store |c_#memory_int| c_~var_1_22_Pointer~0.base v_ArrVal_1011))) (store .cse8 c_~var_1_23_Pointer~0.base (store (select .cse8 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse8 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset)))))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse7 c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset))))) (let ((.cse0 (store .cse7 c_~var_1_24_Pointer~0.base (store (select .cse7 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset .cse1)))) (let ((.cse3 (store (store .cse0 c_~var_1_12_Pointer~0.base (store (select .cse0 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset))))) c_~var_1_15_Pointer~0.base v_ArrVal_1015))) (let ((.cse5 (store .cse3 c_~var_1_1_Pointer~0.base v_ArrVal_1016))) (let ((.cse4 (let ((.cse6 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse6) .cse6)))) (or (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) .cse1))) (not (bvsgt (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse2) .cse2)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))))) (not (bvslt .cse4 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset))) |ULTIMATE.start_property_#t~mem150#1|))) (not (bvsgt .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))))))))))))) is different from false [2024-11-14 04:03:35,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [689640582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:03:35,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024908263] [2024-11-14 04:03:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:03:35,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:03:35,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:03:35,480 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:03:35,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 04:03:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:03:36,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:03:36,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:46,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2024-11-14 04:03:49,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 49 [2024-11-14 04:04:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-14 04:04:00,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:43,831 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-14 04:04:43,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 468 treesize of output 339 [2024-11-14 04:04:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-14 04:04:47,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024908263] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 04:04:47,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:04:47,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24, 24, 11] total 65 [2024-11-14 04:04:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442827773] [2024-11-14 04:04:47,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:04:47,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:04:47,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:04:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:04:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=5777, Unknown=30, NotChecked=954, Total=7140 [2024-11-14 04:04:47,946 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 04:05:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:05:12,608 INFO L93 Difference]: Finished difference Result 511 states and 716 transitions. [2024-11-14 04:05:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 04:05:12,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 161 [2024-11-14 04:05:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:05:12,613 INFO L225 Difference]: With dead ends: 511 [2024-11-14 04:05:12,613 INFO L226 Difference]: Without dead ends: 289 [2024-11-14 04:05:12,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 170.5s TimeCoverageRelationStatistics Valid=433, Invalid=7043, Unknown=30, NotChecked=1050, Total=8556 [2024-11-14 04:05:12,617 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 400 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:05:12,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1102 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2024-11-14 04:05:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-14 04:05:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2024-11-14 04:05:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 214 states have (on average 1.3738317757009346) internal successors, (294), 214 states have internal predecessors, (294), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 04:05:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2024-11-14 04:05:12,632 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 161 [2024-11-14 04:05:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:05:12,633 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2024-11-14 04:05:12,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-14 04:05:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2024-11-14 04:05:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-14 04:05:12,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:05:12,635 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:05:12,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (24)] Forceful destruction successful, exit code 0 [2024-11-14 04:05:12,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-14 04:05:13,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 04:05:13,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:05:13,236 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:05:13,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:05:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash 240313312, now seen corresponding path program 1 times [2024-11-14 04:05:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:05:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072990324] [2024-11-14 04:05:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:05:13,237 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 [2024-11-14 04:05:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:05:13,239 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 04:05:13,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/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 (27)] Waiting until timeout for monitored process [2024-11-14 04:05:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:05:15,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 04:05:15,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:05:24,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 04:05:28,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:05:31,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 04:05:34,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:05:36,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:05:38,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:05:40,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:05:41,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:05:43,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 04:05:45,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2024-11-14 04:05:45,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:05:45,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:05:45,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2024-11-14 04:05:46,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 81 [2024-11-14 04:05:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 2 proven. 498 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-14 04:05:47,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:05:48,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_1118))) (bvsgt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse0) .cse0)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))))) is different from false [2024-11-14 04:05:48,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| c_~var_1_15_Pointer~0.base v_ArrVal_1117))) (or (not (bvsgt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd .cse0 (bvneg .cse0))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))) (not (let ((.cse3 (store .cse1 c_~var_1_1_Pointer~0.base v_ArrVal_1118))) (bvsgt (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 c_~var_1_23_Pointer~0.base) c_~var_1_23_Pointer~0.offset))))) (bvadd (bvneg .cse2) .cse2)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))))))) is different from false [2024-11-14 04:06:01,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_12_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_24_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1117 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_23_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| c_~var_1_22_Pointer~0.base v_ArrVal_1112))) (store .cse7 c_~var_1_23_Pointer~0.base (store (select .cse7 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse7 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset)))))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse6 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset))))) (let ((.cse2 (store .cse6 c_~var_1_24_Pointer~0.base (store (select .cse6 c_~var_1_24_Pointer~0.base) ~var_1_24_Pointer~0.offset .cse3)))) (let ((.cse1 (store (store .cse2 c_~var_1_12_Pointer~0.base (store (select .cse2 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset))))) c_~var_1_15_Pointer~0.base v_ArrVal_1117))) (or (not (bvsgt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))))) (bvadd .cse0 (bvneg .cse0))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))) ((_ sign_extend 24) ((_ extract 7 0) .cse3))) (not (let ((.cse5 (store .cse1 c_~var_1_1_Pointer~0.base v_ArrVal_1118))) (bvsgt (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~var_1_23_Pointer~0.base) ~var_1_23_Pointer~0.offset))))) (bvadd .cse4 (bvneg .cse4))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))))))))))) is different from false [2024-11-14 04:06:02,631 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:06:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072990324] [2024-11-14 04:06:02,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072990324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:06:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [759329335] [2024-11-14 04:06:02,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:06:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:06:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:06:02,633 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:06:02,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b56927c6-9943-4595-b22e-54262cedfc2f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-14 04:06:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:06:07,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 04:06:07,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:06:15,040 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2024-11-14 04:06:15,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 53 [2024-11-14 04:06:15,260 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2024-11-14 04:06:15,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 57 [2024-11-14 04:06:15,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-14 04:06:15,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:06:15,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:06:16,063 INFO L349 Elim1Store]: treesize reduction 60, result has 45.0 percent of original size [2024-11-14 04:06:16,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 103 [2024-11-14 04:06:16,411 INFO L349 Elim1Store]: treesize reduction 122, result has 12.2 percent of original size [2024-11-14 04:06:16,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 36 [2024-11-14 04:06:17,078 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-14 04:06:17,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2024-11-14 04:06:22,464 INFO L349 Elim1Store]: treesize reduction 212, result has 24.6 percent of original size [2024-11-14 04:06:22,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 260 treesize of output 272 [2024-11-14 04:06:50,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:06:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:06:52,213 INFO L349 Elim1Store]: treesize reduction 60, result has 45.0 percent of original size [2024-11-14 04:06:52,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 99 [2024-11-14 04:06:58,111 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-14 04:06:58,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 60 [2024-11-14 04:06:59,411 INFO L349 Elim1Store]: treesize reduction 50, result has 40.5 percent of original size [2024-11-14 04:06:59,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 132 [2024-11-14 04:07:03,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:07:03,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:07:04,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:07:05,678 INFO L349 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2024-11-14 04:07:05,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 88 [2024-11-14 04:07:06,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:07:08,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 04:07:08,706 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2024-11-14 04:07:08,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 79 [2024-11-14 04:07:15,626 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv20 32))) (.cse14 (select |c_#memory_int| (_ bv19 32)))) (let ((.cse8 (select .cse14 c_~var_1_23_Pointer~0.offset)) (.cse34 (select .cse3 c_~var_1_24_Pointer~0.offset))) (and (let ((.cse7 (select |c_#memory_int| (_ bv8 32)))) (let ((.cse63 (select .cse7 c_~var_1_23_Pointer~0.offset))) (let ((.cse35 (exists ((v_prenex_12 (_ BitVec 32))) (= .cse14 (store .cse7 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse7 v_prenex_12))))))) (.cse115 (exists ((v_prenex_11 (_ BitVec 32))) (and (= .cse7 (select |c_#memory_int| v_prenex_11)) (not (= v_prenex_11 (_ bv20 32)))))) (.cse42 ((_ sign_extend 16) ((_ extract 15 0) .cse63))) (.cse125 (select .cse3 c_~var_1_12_Pointer~0.offset)) (.cse124 (select .cse7 c_~var_1_24_Pointer~0.offset)) (.cse27 (select .cse7 c_~var_1_12_Pointer~0.offset)) (.cse9 (select |c_#memory_int| (_ bv10 32))) (.cse95 (exists ((~var_1_10_Pointer~0.offset (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse7 ~var_1_10_Pointer~0.offset))) .cse8))) (.cse116 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= .cse7 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (.cse126 (select .cse14 c_~var_1_12_Pointer~0.offset))) (let ((.cse2 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (exists ((~var_1_10_Pointer~0.offset (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))) .cse8)) (not (= ~var_1_10_Pointer~0.base (_ bv8 32))) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (.cse68 (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse126)))) (.cse69 (exists ((v_prenex_12 (_ BitVec 32))) (let ((.cse146 (select .cse7 v_prenex_12))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse146))) (= .cse146 (select .cse14 v_prenex_12)))))) (.cse36 (and .cse95 .cse116)) (.cse24 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse145 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse144 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse144 c_~var_1_24_Pointer~0.offset .cse145)) (= .cse27 .cse145) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse144 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))))))) (.cse67 (= (store (store .cse7 c_~var_1_12_Pointer~0.offset .cse126) c_~var_1_23_Pointer~0.offset .cse8) .cse14)) (.cse104 (= .cse7 (store (store .cse3 c_~var_1_24_Pointer~0.offset .cse124) c_~var_1_12_Pointer~0.offset .cse27))) (.cse107 (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse125)))) (.cse53 (= c_~var_1_12_Pointer~0.offset c_~var_1_23_Pointer~0.offset)) (.cse45 (= .cse42 .cse8)) (.cse106 (= ((_ sign_extend 16) ((_ extract 15 0) .cse124)) .cse8)) (.cse108 (= c_~var_1_12_Pointer~0.offset c_~var_1_24_Pointer~0.offset)) (.cse85 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse142 (select |c_#memory_int| v_prenex_11)) (.cse143 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse142 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse142 c_~var_1_12_Pointer~0.offset .cse143)) (= .cse34 .cse143))))) (.cse109 (and .cse35 .cse115)) (.cse17 (exists ((v_arrayElimCell_162 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_162)) .cse8))) (.cse23 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32))) (= .cse7 (select |c_#memory_int| ~var_1_10_Pointer~0.base)))) (.cse0 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse27 .cse141) (= .cse34 .cse141))))) (.cse31 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse140 (select |c_#memory_int| v_prenex_17)) (.cse139 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= .cse27 .cse139) (= (store .cse140 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse140 v_prenex_18)))) .cse14) (= .cse3 (store .cse140 c_~var_1_24_Pointer~0.offset .cse139)))))) (.cse96 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))) .cse8) (not (= ~var_1_10_Pointer~0.base (_ bv8 32))) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (.cse1 (exists ((v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (= (let ((.cse138 (select |c_#memory_int| v_prenex_11))) (store .cse138 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse138 v_prenex_12))))) .cse14) (not (= v_prenex_11 (_ bv8 32))) (not (= v_prenex_11 (_ bv20 32)))))) (.cse94 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32))) (let ((.cse137 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse34 .cse137) (= .cse7 (store (select |c_#memory_int| ~var_1_10_Pointer~0.base) c_~var_1_12_Pointer~0.offset .cse137)))))) (.cse84 (or (exists ((v_prenex_16 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 v_prenex_16))))) (exists ((v_prenex_13 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 v_prenex_13))) .cse8)) (exists ((v_prenex_10 (_ BitVec 32))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 v_prenex_10)))) (not (= v_prenex_10 c_~var_1_24_Pointer~0.offset)))) (exists ((v_arrayElimCell_158 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_158)))) (exists ((v_arrayElimCell_157 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_157)))))) (.cse119 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse136 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse7 (store (select |c_#memory_int| v_prenex_11) c_~var_1_12_Pointer~0.offset .cse136)) (= .cse34 .cse136))))) (.cse30 (exists ((v_prenex_11 (_ BitVec 32))) (= .cse7 (select |c_#memory_int| v_prenex_11)))) (.cse28 (exists ((v_prenex_18 (_ BitVec 32))) (= (store .cse7 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse7 v_prenex_18)))) .cse14))) (.cse29 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse135 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse27 .cse135) (= .cse3 (store .cse7 c_~var_1_24_Pointer~0.offset .cse135))))))) (or (and .cse0 (or .cse1 .cse2)) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse6 (select |c_#memory_int| v_prenex_11)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse4 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse4 c_~var_1_24_Pointer~0.offset .cse5)) (= .cse6 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse6 c_~var_1_12_Pointer~0.offset .cse5)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse10 (select |c_#memory_int| v_prenex_14)) (.cse11 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse3 (store .cse10 c_~var_1_24_Pointer~0.offset .cse11)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse10 v_prenex_15))) .cse8) (= .cse7 (store (select |c_#memory_int| ~var_1_10_Pointer~0.base) c_~var_1_12_Pointer~0.offset .cse11)) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (let ((.cse13 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse12 (select |c_#memory_int| ~var_1_10_Pointer~0.base))) (and (= .cse3 (store .cse12 c_~var_1_24_Pointer~0.offset .cse13)) (= .cse7 (store .cse12 c_~var_1_12_Pointer~0.offset .cse13)) (= .cse14 (store .cse12 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse12 v_prenex_18)))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse15 (select |c_#memory_int| v_prenex_17)) (.cse16 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= (store .cse15 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse15 v_prenex_18)))) .cse14) (= .cse7 (store (select |c_#memory_int| v_prenex_11) c_~var_1_12_Pointer~0.offset .cse16)) (= .cse3 (store .cse15 c_~var_1_24_Pointer~0.offset .cse16))))) (and .cse17 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse18 (select |c_#memory_int| v_prenex_11)) (.cse19 (select |c_#memory_int| v_prenex_17)) (.cse20 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= .cse18 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= (store .cse19 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse19 v_prenex_18)))) .cse14) (= .cse7 (store .cse18 c_~var_1_12_Pointer~0.offset .cse20)) (= .cse3 (store .cse19 c_~var_1_24_Pointer~0.offset .cse20))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse21 (select |c_#memory_int| v_prenex_11)) (.cse22 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse21 v_prenex_15))) .cse8) (= .cse3 (store .cse21 c_~var_1_24_Pointer~0.offset .cse22)) (= .cse21 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse21 c_~var_1_12_Pointer~0.offset .cse22))))) (and .cse23 .cse24) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse26 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse25 (select |c_#memory_int| v_prenex_17))) (and (not (= v_prenex_17 (_ bv8 32))) (= (store .cse25 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse25 v_prenex_18)))) .cse14) (= .cse3 (store .cse25 c_~var_1_24_Pointer~0.offset .cse26))))) (= .cse27 .cse26)))) (and .cse23 .cse28 .cse29) (and .cse23 .cse30 .cse31) .cse31 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse33 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse32 (select |c_#memory_int| v_prenex_11))) (and (= .cse32 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= (store .cse32 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse32 v_prenex_12)))) .cse14) (= .cse7 (store .cse32 c_~var_1_12_Pointer~0.offset .cse33)) (not (= v_prenex_11 (_ bv20 32)))))) (= .cse34 .cse33)))) (and .cse0 (or (and .cse23 .cse35) .cse36)) (and (or .cse35 .cse2) .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse37 (select |c_#memory_int| v_prenex_11)) (.cse38 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse37 v_prenex_15))) .cse8) (= .cse3 (store .cse37 c_~var_1_24_Pointer~0.offset .cse38)) (= .cse7 (store .cse37 c_~var_1_12_Pointer~0.offset .cse38))))) (and (let ((.cse44 (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (= v_DerPreprocessor_1 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse42) c_~var_1_12_Pointer~0.offset)))) (.cse52 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse83 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))) c_~var_1_12_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse83) (= v_DerPreprocessor_1 .cse83) (= ((_ sign_extend 16) ((_ extract 15 0) .cse83)) .cse8))))) (.cse43 (not .cse53))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse40 (select .cse7 v_prenex_12))) (let ((.cse41 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse40))))) (let ((.cse39 (select .cse41 c_~var_1_12_Pointer~0.offset))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse39))) (= .cse39 v_DerPreprocessor_1) (= .cse40 (select .cse41 v_prenex_12))))))) (and (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse42) c_~var_1_12_Pointer~0.offset))) .cse8)) .cse43) (and .cse44 .cse45) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse48 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (let ((.cse46 (select .cse48 c_~var_1_12_Pointer~0.offset)) (.cse47 (select .cse48 ~var_1_10_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse46) (= ((_ sign_extend 16) ((_ extract 15 0) .cse47)) .cse8) (= v_DerPreprocessor_1 .cse46) (= (select .cse7 ~var_1_10_Pointer~0.offset) .cse47) (not (= ~var_1_10_Pointer~0.offset c_~var_1_12_Pointer~0.offset)))))) (and (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse49 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse49 ~var_1_10_Pointer~0.offset))) .cse8) (= v_DerPreprocessor_1 (select .cse49 c_~var_1_12_Pointer~0.offset)) (not (= ~var_1_10_Pointer~0.offset c_~var_1_23_Pointer~0.offset))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse51 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (let ((.cse50 (select .cse51 ~var_1_10_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse50)) .cse8) (= v_arrayElimCell_171 .cse50) (= v_DerPreprocessor_1 (select .cse51 c_~var_1_12_Pointer~0.offset)))))) .cse52) .cse53) (exists ((v_prenex_12 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.offset v_prenex_12)) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse56 (select .cse7 v_prenex_12))) (let ((.cse55 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse56))))) (let ((.cse54 (select .cse55 ~var_1_10_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse54)) .cse8) (= (select .cse55 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse56 (select .cse55 v_prenex_12)) (= .cse54 (select .cse7 ~var_1_10_Pointer~0.offset))))))))) (and .cse53 (or (exists ((v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse57 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171)))) (and (= .cse57 .cse8) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (= v_DerPreprocessor_1 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse57) c_~var_1_12_Pointer~0.offset)))))) (exists ((v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse58 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171)))) (and (= .cse58 .cse8) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse59 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse58) c_~var_1_12_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse59) (= v_DerPreprocessor_1 .cse59))))))))) (and (or (and .cse53 (exists ((v_arrayElimCell_172 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_172)) .cse8))) .cse45) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse61 (select .cse7 v_prenex_12))) (let ((.cse60 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse61))))) (and (= (select .cse60 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse61 (select .cse60 v_prenex_12)) (not (= v_prenex_12 c_~var_1_23_Pointer~0.offset))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse62 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse42) c_~var_1_12_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse62)) .cse8) (= .cse63 .cse62) (= v_DerPreprocessor_1 .cse62)))) (and (or (and .cse53 .cse44) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse64 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse42) c_~var_1_12_Pointer~0.offset))) (and (= .cse63 .cse64) (= v_DerPreprocessor_1 .cse64))))) .cse45) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse66 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse42))) (let ((.cse65 (select .cse66 ~var_1_10_Pointer~0.offset))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse65))) (= .cse65 .cse63) (= v_DerPreprocessor_1 (select .cse66 c_~var_1_12_Pointer~0.offset)))))) (and .cse67 (or .cse68 .cse69 (and (exists ((v_arrayElimCell_171 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171)) .cse8)) .cse53) .cse45)) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse70 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse42))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse70 ~var_1_10_Pointer~0.offset)))) (not (= ~var_1_10_Pointer~0.offset c_~var_1_23_Pointer~0.offset)) (= v_DerPreprocessor_1 (select .cse70 c_~var_1_12_Pointer~0.offset))))) .cse52 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse73 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (let ((.cse71 (select .cse73 c_~var_1_12_Pointer~0.offset)) (.cse72 (select .cse73 ~var_1_10_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse71) (= ((_ sign_extend 16) ((_ extract 15 0) .cse72)) .cse8) (= v_arrayElimCell_171 .cse72) (= v_DerPreprocessor_1 .cse71) (= (select .cse7 ~var_1_10_Pointer~0.offset) .cse72))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse76 (select .cse7 v_prenex_12))) (let ((.cse75 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse76))))) (let ((.cse74 (select .cse75 ~var_1_10_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse74)) .cse8) (= (select .cse75 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse76 (select .cse75 v_prenex_12)) (= .cse74 .cse76) (= .cse74 (select .cse7 ~var_1_10_Pointer~0.offset))))))) (and (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32))) (= v_arrayElimCell_171 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))) c_~var_1_12_Pointer~0.offset))) .cse43 .cse45) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse79 (select .cse7 v_prenex_12))) (let ((.cse77 ((_ sign_extend 16) ((_ extract 15 0) .cse79)))) (let ((.cse78 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse77))) (and (= .cse8 .cse77) (= (select .cse78 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse79 .cse63) (= .cse79 (select .cse78 v_prenex_12))))))) (and (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse82 (select .cse7 v_prenex_12))) (let ((.cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse82)))) (let ((.cse81 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse80))) (and (= .cse8 .cse80) (= (select .cse81 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse82 (select .cse81 v_prenex_12))))))) .cse53))) .cse0) (and .cse84 .cse85) (and .cse0 (or .cse1 (exists ((v_arrayElimCell_173 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_173)))))) (and .cse30 .cse24) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse87 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse86 (select |c_#memory_int| v_prenex_11))) (and (= .cse3 (store .cse86 c_~var_1_24_Pointer~0.offset .cse87)) (= .cse7 (store .cse86 c_~var_1_12_Pointer~0.offset .cse87)) (= .cse14 (store .cse86 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse86 v_prenex_18)))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse89 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse88 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse88 c_~var_1_24_Pointer~0.offset .cse89)) (= .cse7 (store (select |c_#memory_int| v_prenex_11) c_~var_1_12_Pointer~0.offset .cse89)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse88 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse91 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse90 (select |c_#memory_int| v_prenex_11))) (and (= .cse3 (store .cse90 c_~var_1_24_Pointer~0.offset .cse91)) (= .cse90 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse90 c_~var_1_12_Pointer~0.offset .cse91)) (= .cse14 (store .cse90 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse90 v_prenex_18)))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse93 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_17 (_ BitVec 32))) (let ((.cse92 (select |c_#memory_int| v_prenex_17))) (and (not (= v_prenex_17 (_ bv8 32))) (= .cse3 (store .cse92 c_~var_1_24_Pointer~0.offset .cse93)) (exists ((v_prenex_18 (_ BitVec 32))) (= (store .cse92 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse92 v_prenex_18)))) .cse14))))) (= .cse27 .cse93)))) (and .cse17 .cse94) (and .cse17 .cse30 .cse0) (and (or .cse95 .cse35) .cse0) (and (or (and .cse67 .cse68) (and .cse96 (or (and .cse53 (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32))) (= (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_175))) c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_3))) (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32))) (let ((.cse97 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_175))) c_~var_1_12_Pointer~0.offset))) (and (= .cse97 v_DerPreprocessor_3) (= .cse97 v_arrayElimCell_175)))))) (and .cse67 (or .cse69 .cse45)) (and (or (exists ((v_DerPreprocessor_3 (_ BitVec 32))) (= v_DerPreprocessor_3 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset .cse42) c_~var_1_12_Pointer~0.offset))) (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse99 (select .cse7 v_prenex_12))) (let ((.cse98 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse99))))) (and (= (select .cse98 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_3) (= .cse99 (select .cse98 v_prenex_12))))))) .cse96)) .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse101 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse100 (select |c_#memory_int| ~var_1_10_Pointer~0.base))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse100 ~var_1_10_Pointer~0.offset))) .cse8) (= .cse7 (store .cse100 c_~var_1_12_Pointer~0.offset .cse101)) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (= .cse34 .cse101)))) (and (or .cse36 (and .cse23 .cse1)) .cse0) (and .cse17 .cse23 .cse30 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse103 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse102 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse102 c_~var_1_24_Pointer~0.offset .cse103)) (= .cse27 .cse103) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse102 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (and .cse23 .cse30 .cse28 .cse29) (and .cse23 .cse30 .cse24) (and .cse104 (or (exists ((v_prenex_15 (_ BitVec 32))) (let ((.cse105 (select .cse3 v_prenex_15))) (and (= .cse105 (select .cse7 v_prenex_15)) (= ((_ sign_extend 16) ((_ extract 15 0) .cse105)) .cse8)))) .cse106 .cse107 (and .cse108 (exists ((v_arrayElimCell_176 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_176)) .cse8)))) .cse0) (and .cse84 .cse30 .cse0) (and (or (and .cse30 .cse96) .cse109) .cse0) (and .cse23 .cse31) (and .cse84 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse110 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse34 .cse110) (exists ((v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse111 (select |c_#memory_int| v_prenex_11))) (and (= (store .cse111 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse111 v_prenex_12)))) .cse14) (= .cse7 (store .cse111 c_~var_1_12_Pointer~0.offset .cse110)) (not (= v_prenex_11 (_ bv20 32))))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse112 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (.cse113 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse3 (store .cse112 c_~var_1_24_Pointer~0.offset .cse113)) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse112 v_prenex_15)))) (= .cse7 (store .cse112 c_~var_1_12_Pointer~0.offset .cse113))))) (and .cse0 (or .cse95 (exists ((v_prenex_11 (_ BitVec 32))) (and (not (= v_prenex_11 (_ bv8 32))) (exists ((v_prenex_12 (_ BitVec 32))) (= (let ((.cse114 (select |c_#memory_int| v_prenex_11))) (store .cse114 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse114 v_prenex_12))))) .cse14)) (not (= v_prenex_11 (_ bv20 32))))))) (and (or (and .cse23 .cse35 .cse115) (and .cse30 .cse95 .cse116)) .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse117 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse34 .cse117) (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse118 (select |c_#memory_int| v_prenex_11))) (and (= .cse118 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= .cse7 (store .cse118 c_~var_1_12_Pointer~0.offset .cse117)) (not (= ~var_1_10_Pointer~0.base (_ bv20 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse118 ~var_1_10_Pointer~0.offset))) .cse8))))))) (and .cse17 .cse119) (and .cse23 .cse84 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse120 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse34 .cse120) (exists ((v_prenex_11 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse121 (select |c_#memory_int| v_prenex_11))) (and (= .cse7 (store .cse121 c_~var_1_12_Pointer~0.offset .cse120)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse121 ~var_1_10_Pointer~0.offset))) .cse8))))))) (let ((.cse122 (select .cse14 c_~var_1_24_Pointer~0.offset))) (and .cse67 .cse104 (= (store (store .cse3 c_~var_1_24_Pointer~0.offset .cse122) c_~var_1_23_Pointer~0.offset .cse8) .cse14) (or (exists ((v_prenex_18 (_ BitVec 32))) (let ((.cse123 (select .cse14 v_prenex_18))) (and (= .cse123 (select .cse3 v_prenex_18)) (= (select .cse7 v_prenex_18) .cse123) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse123)))))) (and (or (= .cse124 .cse122) .cse108) (= ((_ sign_extend 16) ((_ extract 15 0) .cse122)) .cse8)) (and .cse107 (or .cse53 (= .cse125 .cse126))) (and (= .cse63 (select .cse3 c_~var_1_23_Pointer~0.offset)) .cse45) (and (= c_~var_1_23_Pointer~0.offset c_~var_1_24_Pointer~0.offset) (or .cse106 (and .cse108 (exists ((v_arrayElimCell_174 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_174)) .cse8)))))) .cse0)) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse127 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse34 .cse127) (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse128 (select |c_#memory_int| ~var_1_10_Pointer~0.base))) (and (= .cse7 (store .cse128 c_~var_1_12_Pointer~0.offset .cse127)) (= (store .cse128 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse128 v_prenex_12)))) .cse14))))))) (and .cse17 .cse85) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse130 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_14 (_ BitVec 32))) (let ((.cse129 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse129 c_~var_1_24_Pointer~0.offset .cse130)) (not (= v_prenex_14 (_ bv19 32))) (exists ((v_prenex_15 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse129 v_prenex_15))) .cse8))))) (= .cse27 .cse130)))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse132 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse131 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse131 c_~var_1_24_Pointer~0.offset .cse132)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse131 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32)))))) (= .cse27 .cse132)))) (and .cse0 (or (and .cse30 .cse95) .cse109)) (and .cse23 .cse84 .cse30 .cse0) (and .cse17 .cse23 .cse0) (and .cse30 .cse31) (and .cse96 .cse119) (and .cse84 .cse94) (and .cse1 .cse94) (and .cse84 .cse119) (and .cse30 .cse28 .cse29) (and .cse28 .cse29) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse133 (select |c_#memory_int| v_prenex_17)) (.cse134 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= (store .cse133 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse133 v_prenex_18)))) .cse14) (= .cse3 (store .cse133 c_~var_1_24_Pointer~0.offset .cse134)) (= .cse7 (store (select |c_#memory_int| ~var_1_10_Pointer~0.base) c_~var_1_12_Pointer~0.offset .cse134)))))))))) (= (_ bv19 32) c_~var_1_23_Pointer~0.base) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (= (_ bv11 32) c_~var_1_15_Pointer~0.base) (= (_ bv8 32) c_~var_1_12_Pointer~0.base) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) .cse8)) ((_ sign_extend 24) ((_ extract 7 0) .cse34)))) (= c_~var_1_24_Pointer~0.base (_ bv20 32))))) is different from true [2024-11-14 04:07:33,704 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| (_ bv20 32))) (.cse14 (select |c_#memory_int| (_ bv19 32)))) (let ((.cse8 (select .cse14 c_~var_1_23_Pointer~0.offset)) (.cse47 (select .cse3 c_~var_1_24_Pointer~0.offset))) (and (= (_ bv19 32) c_~var_1_23_Pointer~0.base) (= (_ bv4 32) c_~var_1_1_Pointer~0.base) (let ((.cse7 (select |c_#memory_int| (_ bv8 32)))) (let ((.cse34 (select .cse7 c_~var_1_23_Pointer~0.offset))) (let ((.cse48 (exists ((v_prenex_12 (_ BitVec 32))) (= .cse14 (store .cse7 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse7 v_prenex_12))))))) (.cse120 (exists ((v_prenex_11 (_ BitVec 32))) (and (= .cse7 (select |c_#memory_int| v_prenex_11)) (not (= v_prenex_11 (_ bv20 32)))))) (.cse32 (select .cse3 c_~var_1_12_Pointer~0.offset)) (.cse28 (select .cse7 c_~var_1_24_Pointer~0.offset)) (.cse40 (select .cse7 c_~var_1_12_Pointer~0.offset)) (.cse9 (select |c_#memory_int| (_ bv10 32))) (.cse104 (exists ((~var_1_10_Pointer~0.offset (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse7 ~var_1_10_Pointer~0.offset))) .cse8))) (.cse121 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= .cse7 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (.cse53 ((_ sign_extend 16) ((_ extract 15 0) .cse34))) (.cse33 (select .cse14 c_~var_1_12_Pointer~0.offset))) (let ((.cse2 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (exists ((~var_1_10_Pointer~0.offset (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))) .cse8)) (not (= ~var_1_10_Pointer~0.base (_ bv8 32))) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (.cse88 (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse33)))) (.cse31 (= c_~var_1_12_Pointer~0.offset c_~var_1_23_Pointer~0.offset)) (.cse23 (= (store (store .cse7 c_~var_1_12_Pointer~0.offset .cse33) c_~var_1_23_Pointer~0.offset .cse8) .cse14)) (.cse89 (exists ((v_prenex_12 (_ BitVec 32))) (let ((.cse146 (select .cse7 v_prenex_12))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse146))) (= .cse146 (select .cse14 v_prenex_12)))))) (.cse35 (= .cse53 .cse8)) (.cse49 (and .cse104 .cse121)) (.cse37 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse145 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse144 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse144 c_~var_1_24_Pointer~0.offset .cse145)) (= .cse40 .cse145) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse144 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))))))) (.cse24 (= .cse7 (store (store .cse3 c_~var_1_24_Pointer~0.offset .cse28) c_~var_1_12_Pointer~0.offset .cse40))) (.cse27 (= ((_ sign_extend 16) ((_ extract 15 0) .cse28)) .cse8)) (.cse30 (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse32)))) (.cse29 (= c_~var_1_12_Pointer~0.offset c_~var_1_24_Pointer~0.offset)) (.cse94 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse142 (select |c_#memory_int| v_prenex_11)) (.cse143 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse142 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse142 c_~var_1_12_Pointer~0.offset .cse143)) (= .cse47 .cse143))))) (.cse114 (and .cse48 .cse120)) (.cse17 (exists ((v_arrayElimCell_162 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_162)) .cse8))) (.cse36 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32))) (= .cse7 (select |c_#memory_int| ~var_1_10_Pointer~0.base)))) (.cse0 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse40 .cse141) (= .cse47 .cse141))))) (.cse44 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse140 (select |c_#memory_int| v_prenex_17)) (.cse139 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= .cse40 .cse139) (= (store .cse140 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse140 v_prenex_18)))) .cse14) (= .cse3 (store .cse140 c_~var_1_24_Pointer~0.offset .cse139)))))) (.cse105 (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset))) .cse8) (not (= ~var_1_10_Pointer~0.base (_ bv8 32))) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (.cse1 (exists ((v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (and (= (let ((.cse138 (select |c_#memory_int| v_prenex_11))) (store .cse138 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse138 v_prenex_12))))) .cse14) (not (= v_prenex_11 (_ bv8 32))) (not (= v_prenex_11 (_ bv20 32)))))) (.cse103 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32))) (let ((.cse137 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse47 .cse137) (= .cse7 (store (select |c_#memory_int| ~var_1_10_Pointer~0.base) c_~var_1_12_Pointer~0.offset .cse137)))))) (.cse93 (or (exists ((v_prenex_16 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 v_prenex_16))))) (exists ((v_prenex_13 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 v_prenex_13))) .cse8)) (exists ((v_prenex_10 (_ BitVec 32))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 v_prenex_10)))) (not (= v_prenex_10 c_~var_1_24_Pointer~0.offset)))) (exists ((v_arrayElimCell_158 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_158)))) (exists ((v_arrayElimCell_157 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_157)))))) (.cse124 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse136 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse7 (store (select |c_#memory_int| v_prenex_11) c_~var_1_12_Pointer~0.offset .cse136)) (= .cse47 .cse136))))) (.cse43 (exists ((v_prenex_11 (_ BitVec 32))) (= .cse7 (select |c_#memory_int| v_prenex_11)))) (.cse41 (exists ((v_prenex_18 (_ BitVec 32))) (= (store .cse7 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse7 v_prenex_18)))) .cse14))) (.cse42 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse135 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse40 .cse135) (= .cse3 (store .cse7 c_~var_1_24_Pointer~0.offset .cse135))))))) (or (and .cse0 (or .cse1 .cse2)) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse6 (select |c_#memory_int| v_prenex_11)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse4 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse4 c_~var_1_24_Pointer~0.offset .cse5)) (= .cse6 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse6 c_~var_1_12_Pointer~0.offset .cse5)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse10 (select |c_#memory_int| v_prenex_14)) (.cse11 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse3 (store .cse10 c_~var_1_24_Pointer~0.offset .cse11)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse10 v_prenex_15))) .cse8) (= .cse7 (store (select |c_#memory_int| ~var_1_10_Pointer~0.base) c_~var_1_12_Pointer~0.offset .cse11)) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (let ((.cse13 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse12 (select |c_#memory_int| ~var_1_10_Pointer~0.base))) (and (= .cse3 (store .cse12 c_~var_1_24_Pointer~0.offset .cse13)) (= .cse7 (store .cse12 c_~var_1_12_Pointer~0.offset .cse13)) (= .cse14 (store .cse12 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse12 v_prenex_18)))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse15 (select |c_#memory_int| v_prenex_17)) (.cse16 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= (store .cse15 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse15 v_prenex_18)))) .cse14) (= .cse7 (store (select |c_#memory_int| v_prenex_11) c_~var_1_12_Pointer~0.offset .cse16)) (= .cse3 (store .cse15 c_~var_1_24_Pointer~0.offset .cse16))))) (and .cse17 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse18 (select |c_#memory_int| v_prenex_11)) (.cse19 (select |c_#memory_int| v_prenex_17)) (.cse20 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= .cse18 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= (store .cse19 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse19 v_prenex_18)))) .cse14) (= .cse7 (store .cse18 c_~var_1_12_Pointer~0.offset .cse20)) (= .cse3 (store .cse19 c_~var_1_24_Pointer~0.offset .cse20))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse21 (select |c_#memory_int| v_prenex_11)) (.cse22 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse21 v_prenex_15))) .cse8) (= .cse3 (store .cse21 c_~var_1_24_Pointer~0.offset .cse22)) (= .cse21 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse21 c_~var_1_12_Pointer~0.offset .cse22))))) (let ((.cse25 (select .cse14 c_~var_1_24_Pointer~0.offset))) (and .cse23 .cse24 (= (store (store .cse3 c_~var_1_24_Pointer~0.offset .cse25) c_~var_1_23_Pointer~0.offset .cse8) .cse14) (or (exists ((v_prenex_18 (_ BitVec 32))) (let ((.cse26 (select .cse14 v_prenex_18))) (and (= .cse26 (select .cse3 v_prenex_18)) (= (select .cse7 v_prenex_18) .cse26) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse26)))))) (and .cse27 (= c_~var_1_23_Pointer~0.offset c_~var_1_24_Pointer~0.offset)) (and (or (= .cse28 .cse25) .cse29) (= ((_ sign_extend 16) ((_ extract 15 0) .cse25)) .cse8)) (and .cse30 (or .cse31 (= .cse32 .cse33))) (and (= .cse34 (select .cse3 c_~var_1_23_Pointer~0.offset)) .cse35)) .cse0)) (and .cse36 .cse37) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse39 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse38 (select |c_#memory_int| v_prenex_17))) (and (not (= v_prenex_17 (_ bv8 32))) (= (store .cse38 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse38 v_prenex_18)))) .cse14) (= .cse3 (store .cse38 c_~var_1_24_Pointer~0.offset .cse39))))) (= .cse40 .cse39)))) (and .cse36 .cse41 .cse42) (and .cse36 .cse43 .cse44) .cse44 (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse46 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse45 (select |c_#memory_int| v_prenex_11))) (and (= .cse45 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= (store .cse45 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse45 v_prenex_12)))) .cse14) (= .cse7 (store .cse45 c_~var_1_12_Pointer~0.offset .cse46)) (not (= v_prenex_11 (_ bv20 32)))))) (= .cse47 .cse46)))) (and .cse0 (or (and .cse36 .cse48) .cse49)) (and (let ((.cse55 (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (= v_DerPreprocessor_1 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse53) c_~var_1_12_Pointer~0.offset)))) (.cse62 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse90 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))) c_~var_1_12_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse90) (= v_DerPreprocessor_1 .cse90) (= ((_ sign_extend 16) ((_ extract 15 0) .cse90)) .cse8))))) (.cse54 (not .cse31))) (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse51 (select .cse7 v_prenex_12))) (let ((.cse52 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse51))))) (let ((.cse50 (select .cse52 c_~var_1_12_Pointer~0.offset))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse50))) (= .cse50 v_DerPreprocessor_1) (= .cse51 (select .cse52 v_prenex_12))))))) (and (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse53) c_~var_1_12_Pointer~0.offset))) .cse8)) .cse54) (and .cse55 .cse35) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse58 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (let ((.cse56 (select .cse58 c_~var_1_12_Pointer~0.offset)) (.cse57 (select .cse58 ~var_1_10_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse56) (= ((_ sign_extend 16) ((_ extract 15 0) .cse57)) .cse8) (= v_DerPreprocessor_1 .cse56) (= (select .cse7 ~var_1_10_Pointer~0.offset) .cse57) (not (= ~var_1_10_Pointer~0.offset c_~var_1_12_Pointer~0.offset)))))) (and (or (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse59 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse59 ~var_1_10_Pointer~0.offset))) .cse8) (= v_DerPreprocessor_1 (select .cse59 c_~var_1_12_Pointer~0.offset)) (not (= ~var_1_10_Pointer~0.offset c_~var_1_23_Pointer~0.offset))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse61 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (let ((.cse60 (select .cse61 ~var_1_10_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse60)) .cse8) (= v_arrayElimCell_171 .cse60) (= v_DerPreprocessor_1 (select .cse61 c_~var_1_12_Pointer~0.offset)))))) .cse62) .cse31) (exists ((v_prenex_12 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (and (not (= ~var_1_10_Pointer~0.offset v_prenex_12)) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse65 (select .cse7 v_prenex_12))) (let ((.cse64 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse65))))) (let ((.cse63 (select .cse64 ~var_1_10_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse63)) .cse8) (= (select .cse64 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse65 (select .cse64 v_prenex_12)) (= .cse63 (select .cse7 ~var_1_10_Pointer~0.offset))))))))) (and .cse31 (or (exists ((v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse66 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171)))) (and (= .cse66 .cse8) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (= v_DerPreprocessor_1 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse66) c_~var_1_12_Pointer~0.offset)))))) (exists ((v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse67 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171)))) (and (= .cse67 .cse8) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse68 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse67) c_~var_1_12_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse68) (= v_DerPreprocessor_1 .cse68))))))))) (and (or (and .cse31 (exists ((v_arrayElimCell_172 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_172)) .cse8))) .cse35) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse70 (select .cse7 v_prenex_12))) (let ((.cse69 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse70))))) (and (= (select .cse69 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse70 (select .cse69 v_prenex_12)) (not (= v_prenex_12 c_~var_1_23_Pointer~0.offset))))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse71 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse53) c_~var_1_12_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse71)) .cse8) (= .cse34 .cse71) (= v_DerPreprocessor_1 .cse71)))) (and (or (and .cse31 .cse55) (exists ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse72 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse53) c_~var_1_12_Pointer~0.offset))) (and (= .cse34 .cse72) (= v_DerPreprocessor_1 .cse72))))) .cse35) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse74 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse53))) (let ((.cse73 (select .cse74 ~var_1_10_Pointer~0.offset))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) .cse73))) (= .cse73 .cse34) (= v_DerPreprocessor_1 (select .cse74 c_~var_1_12_Pointer~0.offset)))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse75 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse53))) (and (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse75 ~var_1_10_Pointer~0.offset)))) (not (= ~var_1_10_Pointer~0.offset c_~var_1_23_Pointer~0.offset)) (= v_DerPreprocessor_1 (select .cse75 c_~var_1_12_Pointer~0.offset))))) .cse62 (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse78 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))))) (let ((.cse76 (select .cse78 c_~var_1_12_Pointer~0.offset)) (.cse77 (select .cse78 ~var_1_10_Pointer~0.offset))) (and (= v_arrayElimCell_171 .cse76) (= ((_ sign_extend 16) ((_ extract 15 0) .cse77)) .cse8) (= v_arrayElimCell_171 .cse77) (= v_DerPreprocessor_1 .cse76) (= (select .cse7 ~var_1_10_Pointer~0.offset) .cse77))))) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse81 (select .cse7 v_prenex_12))) (let ((.cse80 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse81))))) (let ((.cse79 (select .cse80 ~var_1_10_Pointer~0.offset))) (and (= ((_ sign_extend 16) ((_ extract 15 0) .cse79)) .cse8) (= (select .cse80 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse81 (select .cse80 v_prenex_12)) (= .cse79 .cse81) (= .cse79 (select .cse7 ~var_1_10_Pointer~0.offset))))))) (and (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32))) (= v_arrayElimCell_171 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_171))) c_~var_1_12_Pointer~0.offset))) .cse54 .cse35) (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse84 (select .cse7 v_prenex_12))) (let ((.cse82 ((_ sign_extend 16) ((_ extract 15 0) .cse84)))) (let ((.cse83 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse82))) (and (= .cse8 .cse82) (= (select .cse83 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse84 .cse34) (= .cse84 (select .cse83 v_prenex_12))))))) (and (exists ((v_DerPreprocessor_1 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse87 (select .cse7 v_prenex_12))) (let ((.cse85 ((_ sign_extend 16) ((_ extract 15 0) .cse87)))) (let ((.cse86 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_1) c_~var_1_23_Pointer~0.offset .cse85))) (and (= .cse8 .cse85) (= (select .cse86 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_1) (= .cse87 (select .cse86 v_prenex_12))))))) .cse31) (and .cse23 (or .cse88 .cse89 .cse35)))) .cse0) (and (or .cse48 .cse2) .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse91 (select |c_#memory_int| v_prenex_11)) (.cse92 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse91 v_prenex_15))) .cse8) (= .cse3 (store .cse91 c_~var_1_24_Pointer~0.offset .cse92)) (= .cse7 (store .cse91 c_~var_1_12_Pointer~0.offset .cse92))))) (and .cse93 .cse94) (and .cse0 (or .cse1 (exists ((v_arrayElimCell_173 (_ BitVec 32))) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_173)))))) (and .cse43 .cse37) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse96 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse95 (select |c_#memory_int| v_prenex_11))) (and (= .cse3 (store .cse95 c_~var_1_24_Pointer~0.offset .cse96)) (= .cse7 (store .cse95 c_~var_1_12_Pointer~0.offset .cse96)) (= .cse14 (store .cse95 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse95 v_prenex_18)))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse98 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse97 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse97 c_~var_1_24_Pointer~0.offset .cse98)) (= .cse7 (store (select |c_#memory_int| v_prenex_11) c_~var_1_12_Pointer~0.offset .cse98)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse97 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse100 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse99 (select |c_#memory_int| v_prenex_11))) (and (= .cse3 (store .cse99 c_~var_1_24_Pointer~0.offset .cse100)) (= .cse99 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (= .cse7 (store .cse99 c_~var_1_12_Pointer~0.offset .cse100)) (= .cse14 (store .cse99 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse99 v_prenex_18)))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse102 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_17 (_ BitVec 32))) (let ((.cse101 (select |c_#memory_int| v_prenex_17))) (and (not (= v_prenex_17 (_ bv8 32))) (= .cse3 (store .cse101 c_~var_1_24_Pointer~0.offset .cse102)) (exists ((v_prenex_18 (_ BitVec 32))) (= (store .cse101 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse101 v_prenex_18)))) .cse14))))) (= .cse40 .cse102)))) (and .cse17 .cse103) (and .cse17 .cse43 .cse0) (and (or .cse104 .cse48) .cse0) (and (or (and .cse23 .cse88) (and .cse105 (or (and .cse31 (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32))) (= (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_175))) c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_3))) (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32))) (let ((.cse106 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_175))) c_~var_1_12_Pointer~0.offset))) (and (= .cse106 v_DerPreprocessor_3) (= .cse106 v_arrayElimCell_175)))))) (and .cse23 (or .cse89 .cse35)) (and (or (exists ((v_DerPreprocessor_3 (_ BitVec 32))) (= v_DerPreprocessor_3 (select (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset .cse53) c_~var_1_12_Pointer~0.offset))) (exists ((v_DerPreprocessor_3 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse108 (select .cse7 v_prenex_12))) (let ((.cse107 (store (store .cse7 c_~var_1_12_Pointer~0.offset v_DerPreprocessor_3) c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) .cse108))))) (and (= (select .cse107 c_~var_1_12_Pointer~0.offset) v_DerPreprocessor_3) (= .cse108 (select .cse107 v_prenex_12))))))) .cse105)) .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse110 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse109 (select |c_#memory_int| ~var_1_10_Pointer~0.base))) (and (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse109 ~var_1_10_Pointer~0.offset))) .cse8) (= .cse7 (store .cse109 c_~var_1_12_Pointer~0.offset .cse110)) (not (= ~var_1_10_Pointer~0.base (_ bv20 32)))))) (= .cse47 .cse110)))) (and (or .cse49 (and .cse36 .cse1)) .cse0) (and .cse17 .cse36 .cse43 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse112 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset)))) (.cse111 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse111 c_~var_1_24_Pointer~0.offset .cse112)) (= .cse40 .cse112) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse111 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32))) (not (= v_prenex_14 (_ bv8 32)))))) (and .cse36 .cse43 .cse41 .cse42) (and .cse36 .cse43 .cse37) (and .cse24 (or (exists ((v_prenex_15 (_ BitVec 32))) (let ((.cse113 (select .cse3 v_prenex_15))) (and (= .cse113 (select .cse7 v_prenex_15)) (= ((_ sign_extend 16) ((_ extract 15 0) .cse113)) .cse8)))) .cse27 .cse30 (and .cse29 (exists ((v_arrayElimCell_176 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_176)) .cse8)))) .cse0) (and .cse93 .cse43 .cse0) (and (or (and .cse43 .cse105) .cse114) .cse0) (and .cse36 .cse44) (and .cse93 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse115 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse47 .cse115) (exists ((v_prenex_12 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32))) (let ((.cse116 (select |c_#memory_int| v_prenex_11))) (and (= (store .cse116 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse116 v_prenex_12)))) .cse14) (= .cse7 (store .cse116 c_~var_1_12_Pointer~0.offset .cse115)) (not (= v_prenex_11 (_ bv20 32))))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_15 (_ BitVec 32))) (let ((.cse117 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (.cse118 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse3 (store .cse117 c_~var_1_24_Pointer~0.offset .cse118)) (= .cse8 ((_ sign_extend 16) ((_ extract 15 0) (select .cse117 v_prenex_15)))) (= .cse7 (store .cse117 c_~var_1_12_Pointer~0.offset .cse118))))) (and .cse0 (or .cse104 (exists ((v_prenex_11 (_ BitVec 32))) (and (not (= v_prenex_11 (_ bv8 32))) (exists ((v_prenex_12 (_ BitVec 32))) (= (let ((.cse119 (select |c_#memory_int| v_prenex_11))) (store .cse119 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse119 v_prenex_12))))) .cse14)) (not (= v_prenex_11 (_ bv20 32))))))) (and (or (and .cse36 .cse48 .cse120) (and .cse43 .cse104 .cse121)) .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse122 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse47 .cse122) (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse123 (select |c_#memory_int| v_prenex_11))) (and (= .cse123 (select |c_#memory_int| ~var_1_10_Pointer~0.base)) (not (= ~var_1_10_Pointer~0.base (_ bv19 32))) (= .cse7 (store .cse123 c_~var_1_12_Pointer~0.offset .cse122)) (not (= ~var_1_10_Pointer~0.base (_ bv20 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse123 ~var_1_10_Pointer~0.offset))) .cse8))))))) (and .cse17 .cse124) (and .cse36 .cse93 .cse0) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse125 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse47 .cse125) (exists ((v_prenex_11 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse126 (select |c_#memory_int| v_prenex_11))) (and (= .cse7 (store .cse126 c_~var_1_12_Pointer~0.offset .cse125)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse126 ~var_1_10_Pointer~0.offset))) .cse8))))))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse127 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (= .cse47 .cse127) (exists ((~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse128 (select |c_#memory_int| ~var_1_10_Pointer~0.base))) (and (= .cse7 (store .cse128 c_~var_1_12_Pointer~0.offset .cse127)) (= (store .cse128 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse128 v_prenex_12)))) .cse14))))))) (and .cse17 .cse94) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse130 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_14 (_ BitVec 32))) (let ((.cse129 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse129 c_~var_1_24_Pointer~0.offset .cse130)) (not (= v_prenex_14 (_ bv19 32))) (exists ((v_prenex_15 (_ BitVec 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse129 v_prenex_15))) .cse8))))) (= .cse40 .cse130)))) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse132 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse131 (select |c_#memory_int| v_prenex_14))) (and (= .cse3 (store .cse131 c_~var_1_24_Pointer~0.offset .cse132)) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse131 v_prenex_15))) .cse8) (not (= v_prenex_14 (_ bv19 32)))))) (= .cse40 .cse132)))) (and .cse0 (or (and .cse43 .cse104) .cse114)) (and .cse36 .cse93 .cse43 .cse0) (and .cse17 .cse36 .cse0) (and .cse43 .cse44) (and .cse105 .cse124) (and .cse93 .cse103) (and .cse1 .cse103) (and .cse93 .cse124) (and .cse43 .cse41 .cse42) (and .cse41 .cse42) (exists ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (~var_1_10_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse133 (select |c_#memory_int| v_prenex_17)) (.cse134 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 ~var_1_14_Pointer~0.offset))))) (and (not (= v_prenex_17 (_ bv8 32))) (= (store .cse133 c_~var_1_23_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select .cse133 v_prenex_18)))) .cse14) (= .cse3 (store .cse133 c_~var_1_24_Pointer~0.offset .cse134)) (= .cse7 (store (select |c_#memory_int| ~var_1_10_Pointer~0.base) c_~var_1_12_Pointer~0.offset .cse134)))))))))) (= (_ bv11 32) c_~var_1_15_Pointer~0.base) (= (_ bv8 32) c_~var_1_12_Pointer~0.base) (not (bvsle ((_ zero_extend 16) ((_ extract 15 0) .cse8)) ((_ sign_extend 24) ((_ extract 7 0) .cse47)))) (= c_~var_1_24_Pointer~0.base (_ bv20 32))))) is different from true