./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:48:17,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:48:18,060 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:48:18,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:48:18,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:48:18,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:48:18,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:48:18,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:48:18,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:48:18,093 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:48:18,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:48:18,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:48:18,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:48:18,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:48:18,096 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:48:18,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:48:18,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:48:18,097 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:48:18,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:48:18,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:48:18,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:48:18,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:48:18,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:48:18,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:48:18,101 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:48:18,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:48:18,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:48:18,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:48:18,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:48:18,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:48:18,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:48:18,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:48:18,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:48:18,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:48:18,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:48:18,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:48:18,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:48:18,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:48:18,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:48:18,106 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:48:18,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:48:18,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:48:18,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a [2023-11-29 02:48:18,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:48:18,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:48:18,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:48:18,363 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:48:18,363 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:48:18,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-11-29 02:48:21,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:48:21,290 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:48:21,291 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-11-29 02:48:21,298 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data/efe2b951b/e7f649e8ff654524b917768707fc637e/FLAGc4e0d5982 [2023-11-29 02:48:21,309 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data/efe2b951b/e7f649e8ff654524b917768707fc637e [2023-11-29 02:48:21,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:48:21,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:48:21,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:48:21,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:48:21,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:48:21,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245b66fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21, skipping insertion in model container [2023-11-29 02:48:21,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,347 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:48:21,479 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-11-29 02:48:21,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:48:21,525 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:48:21,539 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-11-29 02:48:21,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:48:21,571 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:48:21,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21 WrapperNode [2023-11-29 02:48:21,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:48:21,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:48:21,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:48:21,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:48:21,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,621 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2023-11-29 02:48:21,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:48:21,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:48:21,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:48:21,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:48:21,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 02:48:21,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:48:21,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:48:21,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:48:21,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:48:21,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (1/1) ... [2023-11-29 02:48:21,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:48:21,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:48:21,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:48:21,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:48:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:48:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:48:21,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:48:21,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:48:21,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:48:21,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:48:21,817 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:48:21,820 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:48:22,023 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:48:22,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:48:22,067 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:48:22,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:22 BoogieIcfgContainer [2023-11-29 02:48:22,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:48:22,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:48:22,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:48:22,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:48:22,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:48:21" (1/3) ... [2023-11-29 02:48:22,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b377ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:48:22, skipping insertion in model container [2023-11-29 02:48:22,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:21" (2/3) ... [2023-11-29 02:48:22,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b377ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:48:22, skipping insertion in model container [2023-11-29 02:48:22,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:22" (3/3) ... [2023-11-29 02:48:22,076 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-9.i [2023-11-29 02:48:22,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:48:22,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:48:22,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:48:22,136 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@73dd7fd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:48:22,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:48:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 02:48:22,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 02:48:22,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:22,151 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:22,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:48:22,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 364597730, now seen corresponding path program 1 times [2023-11-29 02:48:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941961054] [2023-11-29 02:48:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:22,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:22,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941961054] [2023-11-29 02:48:22,322 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-29 02:48:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996272292] [2023-11-29 02:48:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:22,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:48:22,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:48:22,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:48:22,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:48:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:22,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:48:22,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 02:48:22,502 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:48:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996272292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:22,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:22,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:48:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829338536] [2023-11-29 02:48:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:22,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:48:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:48:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:48:22,544 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 02:48:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:48:22,576 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2023-11-29 02:48:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:48:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-11-29 02:48:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:48:22,586 INFO L225 Difference]: With dead ends: 63 [2023-11-29 02:48:22,587 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 02:48:22,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:48:22,593 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:48:22,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:48:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 02:48:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 02:48:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 02:48:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2023-11-29 02:48:22,629 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 41 [2023-11-29 02:48:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:48:22,629 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2023-11-29 02:48:22,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 02:48:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2023-11-29 02:48:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 02:48:22,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:22,632 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:22,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:48:22,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 02:48:22,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:48:22,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash 503766628, now seen corresponding path program 1 times [2023-11-29 02:48:22,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:22,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893041009] [2023-11-29 02:48:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:22,876 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:48:22,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663881131] [2023-11-29 02:48:22,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:48:22,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:48:22,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:48:22,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:48:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:22,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:48:22,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 02:48:23,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:48:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893041009] [2023-11-29 02:48:23,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 02:48:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663881131] [2023-11-29 02:48:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663881131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:48:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432057025] [2023-11-29 02:48:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:23,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:48:23,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:48:23,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:48:23,034 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:48:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:48:23,082 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2023-11-29 02:48:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:48:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2023-11-29 02:48:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:48:23,084 INFO L225 Difference]: With dead ends: 62 [2023-11-29 02:48:23,084 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 02:48:23,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:48:23,086 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:48:23,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:48:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 02:48:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-29 02:48:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 02:48:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2023-11-29 02:48:23,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 41 [2023-11-29 02:48:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:48:23,096 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2023-11-29 02:48:23,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:48:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2023-11-29 02:48:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:48:23,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:23,098 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:23,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:48:23,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:48:23,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:48:23,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1515645239, now seen corresponding path program 1 times [2023-11-29 02:48:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232922299] [2023-11-29 02:48:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:23,329 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:48:23,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064990934] [2023-11-29 02:48:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:48:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:48:23,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:48:23,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:48:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:23,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 02:48:23,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 02:48:25,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:48:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 02:48:25,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:25,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232922299] [2023-11-29 02:48:25,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 02:48:25,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064990934] [2023-11-29 02:48:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064990934] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 02:48:25,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:48:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2023-11-29 02:48:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775005680] [2023-11-29 02:48:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:25,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:48:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:48:25,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:48:25,804 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 02:48:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:48:25,985 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2023-11-29 02:48:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:48:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2023-11-29 02:48:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:48:25,989 INFO L225 Difference]: With dead ends: 133 [2023-11-29 02:48:25,989 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 02:48:25,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:48:25,991 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 172 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:48:25,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 122 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:48:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 02:48:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 53. [2023-11-29 02:48:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:48:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2023-11-29 02:48:26,006 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 43 [2023-11-29 02:48:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:48:26,007 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2023-11-29 02:48:26,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 02:48:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2023-11-29 02:48:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:48:26,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:26,009 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:26,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:48:26,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:48:26,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:48:26,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -812733619, now seen corresponding path program 1 times [2023-11-29 02:48:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430444785] [2023-11-29 02:48:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:26,237 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:48:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329432223] [2023-11-29 02:48:26,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:26,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:48:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:48:26,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:48:26,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:48:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:48:26,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:48:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:48:26,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:48:26,380 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:48:26,381 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:48:26,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:48:26,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:48:26,586 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 02:48:26,589 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:48:26,623 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 02:48:26,625 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short9 could not be translated [2023-11-29 02:48:26,626 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short9 could not be translated [2023-11-29 02:48:26,626 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 02:48:26,627 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 02:48:26,627 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short9 could not be translated [2023-11-29 02:48:26,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:48:26 BoogieIcfgContainer [2023-11-29 02:48:26,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:48:26,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:48:26,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:48:26,641 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:48:26,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:22" (3/4) ... [2023-11-29 02:48:26,643 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:48:26,644 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:48:26,645 INFO L158 Benchmark]: Toolchain (without parser) took 5332.30ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 104.4MB in the beginning and 49.2MB in the end (delta: 55.2MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2023-11-29 02:48:26,645 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:48:26,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.81ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 92.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 02:48:26,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.81ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:48:26,646 INFO L158 Benchmark]: Boogie Preprocessor took 49.80ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:48:26,647 INFO L158 Benchmark]: RCFGBuilder took 394.35ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 69.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 02:48:26,647 INFO L158 Benchmark]: TraceAbstraction took 4569.67ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 68.8MB in the beginning and 50.2MB in the end (delta: 18.5MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2023-11-29 02:48:26,648 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 182.5MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:48:26,650 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.14ms. Allocated memory is still 142.6MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.81ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 92.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.81ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.80ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 394.35ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 69.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4569.67ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 68.8MB in the beginning and 50.2MB in the end (delta: 18.5MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 182.5MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of shiftLeft at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed long int var_1_14 = -16; [L31] unsigned char last_1_var_1_1 = 10; [L32] double last_1_var_1_10 = 9.2; [L33] signed short int last_1_var_1_12 = 1; [L34] signed long int last_1_var_1_14 = -16; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L75] last_1_var_1_1 = var_1_1 [L76] last_1_var_1_10 = var_1_10 [L77] last_1_var_1_12 = var_1_12 [L78] last_1_var_1_14 = var_1_14 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L67] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L67] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L68] var_1_7 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_8=100, var_1_9=32] [L69] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_8=100, var_1_9=32] [L70] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L70] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L89] RET updateVariables() [L90] CALL step() [L38] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L39] COND TRUE ((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0 [L40] var_1_12 = ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=46/5, var_1_12=10, var_1_14=-16, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L45] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=100, var_1_9=32] [L45] COND TRUE (10 << var_1_12) < (var_1_3 * var_1_14) [L46] var_1_8 = (var_1_12 + var_1_14) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=64] [L50] COND TRUE var_1_12 <= 16 [L51] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=64] [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=64] [L81] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=64] [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=64] [L81-L82] return ((((((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? (var_1_12 == ((signed short int) ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : (var_1_12 == ((signed short int) last_1_var_1_12)))) && (var_1_14 == ((signed long int) var_1_12)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=64] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=10, var_1_7=0, var_1_8=20, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 106 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 51 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 825 SizeOfPredicates, 11 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 151/160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 02:48:26,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:48:28,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:48:28,717 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 02:48:28,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:48:28,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:48:28,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:48:28,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:48:28,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:48:28,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:48:28,754 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:48:28,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:48:28,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:48:28,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:48:28,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:48:28,757 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:48:28,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:48:28,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:48:28,758 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:48:28,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:48:28,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:48:28,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:48:28,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:48:28,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:48:28,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:48:28,762 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:48:28,762 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:48:28,762 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:48:28,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:48:28,763 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:48:28,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:48:28,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:48:28,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:48:28,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:48:28,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:48:28,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:48:28,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:48:28,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:48:28,766 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:48:28,766 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:48:28,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:48:28,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:48:28,767 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:48:28,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:48:28,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:48:28,767 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:48:28,767 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55037b62375e05a5c79aaa8d2ac5e5451bfc132363388b25e1fdb93ff36dc22a [2023-11-29 02:48:29,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:48:29,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:48:29,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:48:29,082 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:48:29,083 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:48:29,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-11-29 02:48:31,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:48:32,071 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:48:32,071 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i [2023-11-29 02:48:32,080 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data/b3c2f023a/2df10cb7b87441b4a0b9aaf91ed3c643/FLAG579bab00a [2023-11-29 02:48:32,095 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/data/b3c2f023a/2df10cb7b87441b4a0b9aaf91ed3c643 [2023-11-29 02:48:32,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:48:32,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:48:32,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:48:32,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:48:32,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:48:32,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59716313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32, skipping insertion in model container [2023-11-29 02:48:32,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,133 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:48:32,278 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-11-29 02:48:32,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:48:32,327 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:48:32,341 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-9.i[912,925] [2023-11-29 02:48:32,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:48:32,379 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:48:32,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32 WrapperNode [2023-11-29 02:48:32,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:48:32,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:48:32,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:48:32,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:48:32,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,421 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2023-11-29 02:48:32,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:48:32,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:48:32,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:48:32,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:48:32,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,452 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 02:48:32,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:48:32,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:48:32,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:48:32,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:48:32,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (1/1) ... [2023-11-29 02:48:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:48:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:48:32,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:48:32,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:48:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:48:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:48:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:48:32,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:48:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:48:32,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:48:32,628 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:48:32,631 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:48:32,845 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:48:32,895 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:48:32,896 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:48:32,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:32 BoogieIcfgContainer [2023-11-29 02:48:32,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:48:32,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:48:32,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:48:32,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:48:32,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:48:32" (1/3) ... [2023-11-29 02:48:32,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f26b14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:48:32, skipping insertion in model container [2023-11-29 02:48:32,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:32" (2/3) ... [2023-11-29 02:48:32,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f26b14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:48:32, skipping insertion in model container [2023-11-29 02:48:32,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:32" (3/3) ... [2023-11-29 02:48:32,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-9.i [2023-11-29 02:48:32,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:48:32,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:48:32,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:48:32,979 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3e7155b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:48:32,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:48:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 02:48:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:48:32,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:32,993 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:32,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:48:32,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1874091188, now seen corresponding path program 1 times [2023-11-29 02:48:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:48:33,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952955518] [2023-11-29 02:48:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:33,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 [2023-11-29 02:48:33,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:48:33,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:48:33,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 02:48:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:33,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:48:33,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 02:48:33,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:48:33,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:48:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952955518] [2023-11-29 02:48:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952955518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:33,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:33,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:48:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884889123] [2023-11-29 02:48:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:33,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:48:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:48:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:48:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:48:33,227 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:48:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:48:33,276 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2023-11-29 02:48:33,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:48:33,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-11-29 02:48:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:48:33,287 INFO L225 Difference]: With dead ends: 52 [2023-11-29 02:48:33,287 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 02:48:33,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:48:33,294 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:48:33,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:48:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 02:48:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 02:48:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 02:48:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-29 02:48:33,332 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 38 [2023-11-29 02:48:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:48:33,333 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-29 02:48:33,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:48:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-29 02:48:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:48:33,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:33,335 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:33,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:48:33,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:48:33,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:48:33,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1769860978, now seen corresponding path program 1 times [2023-11-29 02:48:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:48:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274896604] [2023-11-29 02:48:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:33,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:48:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:48:33,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:48:33,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 02:48:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:33,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:48:33,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 02:48:34,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:48:34,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:48:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274896604] [2023-11-29 02:48:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274896604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:48:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470960611] [2023-11-29 02:48:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:34,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:48:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:48:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:48:34,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:48:34,012 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:48:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:48:34,285 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2023-11-29 02:48:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:48:34,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-11-29 02:48:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:48:34,287 INFO L225 Difference]: With dead ends: 73 [2023-11-29 02:48:34,287 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 02:48:34,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:48:34,290 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:48:34,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:48:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 02:48:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-11-29 02:48:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:48:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-11-29 02:48:34,307 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 38 [2023-11-29 02:48:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:48:34,308 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-11-29 02:48:34,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:48:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-11-29 02:48:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:48:34,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:34,310 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:34,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 02:48:34,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:48:34,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:48:34,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 960514352, now seen corresponding path program 1 times [2023-11-29 02:48:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:48:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731767007] [2023-11-29 02:48:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:34,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:48:34,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:48:34,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:48:34,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 02:48:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:34,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 02:48:34,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 02:49:42,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:42,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731767007] [2023-11-29 02:49:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731767007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:42,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:42,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:49:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516913280] [2023-11-29 02:49:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:42,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:49:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:42,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:49:42,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:49:42,824 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:49:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:49:43,992 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-11-29 02:49:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:49:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-11-29 02:49:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:49:43,994 INFO L225 Difference]: With dead ends: 63 [2023-11-29 02:49:43,994 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 02:49:43,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:49:43,996 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:49:43,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 149 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:49:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 02:49:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2023-11-29 02:49:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:49:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-11-29 02:49:44,004 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 38 [2023-11-29 02:49:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:49:44,004 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-11-29 02:49:44,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:49:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-11-29 02:49:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:49:44,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:49:44,006 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:49:44,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 02:49:44,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:49:44,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:49:44,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1017772654, now seen corresponding path program 1 times [2023-11-29 02:49:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386387811] [2023-11-29 02:49:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:44,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:49:44,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:44,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:49:44,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 02:49:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:44,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 02:49:44,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:50:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 02:50:23,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:50:23,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:50:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386387811] [2023-11-29 02:50:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386387811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:23,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:23,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:50:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080500516] [2023-11-29 02:50:23,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:23,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:50:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:50:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:50:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:50:23,755 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:50:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:50:25,105 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2023-11-29 02:50:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:50:25,105 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-11-29 02:50:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:50:25,107 INFO L225 Difference]: With dead ends: 61 [2023-11-29 02:50:25,107 INFO L226 Difference]: Without dead ends: 59 [2023-11-29 02:50:25,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:50:25,108 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 70 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:50:25,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 126 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:50:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-29 02:50:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2023-11-29 02:50:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:50:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-29 02:50:25,115 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 38 [2023-11-29 02:50:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:50:25,116 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-29 02:50:25,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 02:50:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-29 02:50:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 02:50:25,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:50:25,118 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:25,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 02:50:25,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:50:25,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:50:25,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash 772996836, now seen corresponding path program 1 times [2023-11-29 02:50:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:50:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118141519] [2023-11-29 02:50:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:25,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:50:25,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:50:25,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:50:25,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 02:50:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:25,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 02:50:25,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:50:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-29 02:50:25,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:50:25,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:50:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118141519] [2023-11-29 02:50:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118141519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:25,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:50:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160155912] [2023-11-29 02:50:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:25,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:50:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:50:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:50:25,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:50:25,628 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 02:50:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:50:26,285 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2023-11-29 02:50:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:50:26,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2023-11-29 02:50:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:50:26,289 INFO L225 Difference]: With dead ends: 150 [2023-11-29 02:50:26,289 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 02:50:26,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:50:26,290 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 132 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:50:26,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 166 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:50:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 02:50:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2023-11-29 02:50:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 states have internal predecessors, (76), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 02:50:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2023-11-29 02:50:26,309 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 75 [2023-11-29 02:50:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:50:26,309 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2023-11-29 02:50:26,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 02:50:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2023-11-29 02:50:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 02:50:26,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:50:26,312 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 02:50:26,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 02:50:26,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:50:26,512 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:50:26,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -36349790, now seen corresponding path program 1 times [2023-11-29 02:50:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:50:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898953182] [2023-11-29 02:50:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:26,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:50:26,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:50:26,514 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:50:26,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4b2565f-9737-43dc-9cbf-e0414bc0075b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 02:50:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:26,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 02:50:26,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-29 02:52:12,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:59,545 WARN L293 SmtUtils]: Spent 14.44s on a formula simplification that was a NOOP. DAG size: 284 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:54:51,413 WARN L293 SmtUtils]: Spent 13.18s on a formula simplification that was a NOOP. DAG size: 278 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:55:48,238 WARN L293 SmtUtils]: Spent 11.47s on a formula simplification that was a NOOP. DAG size: 237 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:56:53,271 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:57:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-29 02:57:06,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:57:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898953182] [2023-11-29 02:57:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898953182] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 02:57:06,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:57:06,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2023-11-29 02:57:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901134684] [2023-11-29 02:57:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:57:06,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:57:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:57:06,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:57:06,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=303, Unknown=20, NotChecked=0, Total=420 [2023-11-29 02:57:06,761 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 02:57:09,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:13,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:16,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:33,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:36,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:38,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:43,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:48,178 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 16) c_~var_1_12~0)) (.cse7 ((_ sign_extend 16) c_~last_1_var_1_12~0)) (.cse6 ((_ zero_extend 24) c_~last_1_var_1_1~0))) (let ((.cse8 (bvslt (bvadd .cse7 .cse6) (_ bv10 32))) (.cse94 (fp.eq c_~var_1_11~0 c_~var_1_11~0)) (.cse184 (= .cse2 c_~var_1_14~0))) (let ((.cse31 (and .cse94 .cse184)) (.cse0 (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse6)))) (.cse55 (not .cse8)) (.cse1 (= .cse7 .cse2)) (.cse4 (bvshl (_ bv10 32) .cse2)) (.cse13 (bvneg .cse7))) (let ((.cse29 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse212 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse212)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse212 (bvneg ~last_1_var_1_14~0)) .cse6)))))) (.cse30 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse211 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse211 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse211)))))))) (.cse10 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse209 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse210 (bvadd .cse7 .cse209 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt (bvadd .cse7 .cse13 .cse209) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse210)))) (not (bvsgt .cse210 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse8)) (.cse68 (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse208 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse208 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse208))))) (bvslt .cse4 (bvmul .cse2 .cse208))))) .cse8)) (.cse73 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse206 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse207 (bvadd .cse7 .cse206 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse206))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse207)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse206))))) (not (bvsgt .cse207 .cse6)))))) .cse1 .cse8)) (.cse87 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse205 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse205))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse205))))) (not (bvsgt (bvadd .cse7 .cse205 (bvneg ~last_1_var_1_14~0)) .cse6))))) .cse1 .cse8)) (.cse92 (or .cse94 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse201 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse201))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse201 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse201))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse202 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse202 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse202))))) (bvslt .cse4 (bvmul .cse2 .cse202))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse203 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse203))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse203))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse203 (bvneg ~last_1_var_1_14~0)) .cse6))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse204 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse204))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse204 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse204))))))))))) (.cse9 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse200 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse199 (bvadd .cse7 .cse13 .cse200))) (or (bvsgt .cse199 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse199))) (not (bvslt .cse4 (bvmul .cse200 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse200 (bvneg ~last_1_var_1_14~0)) .cse6))))))) (.cse18 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse198 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse197 (bvadd .cse7 .cse13 .cse198))) (or (bvsgt .cse197 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse197))) (not (bvslt .cse4 (bvmul .cse198 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse198 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))))) (.cse97 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse195 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse196 (bvadd .cse7 .cse13 .cse195))) (or (not (bvslt .cse4 (bvmul .cse2 .cse195))) (bvsgt .cse196 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse196))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse195 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))))) (.cse104 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse193 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse194 (bvadd .cse7 .cse13 .cse193))) (or (not (bvslt .cse4 (bvmul .cse2 .cse193))) (bvsgt .cse194 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse194))) (not (bvsgt (bvadd .cse7 .cse193 (bvneg ~last_1_var_1_14~0)) .cse6))))))) (.cse11 (and .cse55 .cse1)) (.cse119 (not .cse0)) (.cse32 (or .cse31 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse189 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse189))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse189 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse189 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse190 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse190))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse190 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvslt .cse4 (bvmul .cse190 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse191 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse191 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse191))))) (bvslt .cse4 (bvmul .cse191 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse192 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse192 (bvneg ~last_1_var_1_14~0)) .cse6))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse192))))) (not (bvslt .cse4 (bvmul .cse192 c_~var_1_14~0))))))))) (.cse34 (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse188 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse188 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse188))))) (bvslt .cse4 (bvmul .cse188 c_~var_1_14~0))))))) (.cse42 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse187 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse187))))) (not (bvslt .cse4 (bvmul .cse187 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse187 (bvneg ~last_1_var_1_14~0)) .cse6))))) .cse1 .cse8)) (.cse60 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse186 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse185 (bvadd .cse7 .cse186 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse185)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse186))))) (not (bvslt .cse4 (bvmul .cse186 c_~var_1_14~0))) (not (bvsgt .cse185 .cse6)))))) .cse1 .cse8)) (.cse26 (not .cse94)) (.cse27 (not .cse184))) (and (or .cse0 (and (or (and (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse3 (bvadd .cse7 .cse5 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse3)))) (not (bvslt .cse4 (bvmul .cse5 c_~var_1_14~0))) (not (bvsgt .cse3 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse8) (or .cse1 .cse9) .cse10 (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse12 (bvadd .cse7 .cse14 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse12)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse14)))) (not (bvsgt .cse12 .cse6)) (bvslt .cse4 (bvmul .cse14 c_~var_1_14~0)) (bvsgt ~last_1_var_1_14~0 .cse7)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse15 (bvneg ~last_1_var_1_14~0)) .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse15)))) (bvslt .cse4 (bvmul .cse15 c_~var_1_14~0))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse16 (bvadd .cse7 .cse17 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse16)))) (not (bvsgt .cse16 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse17 c_~var_1_14~0)))))) .cse1 .cse8) .cse18 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse20 (bvadd .cse7 .cse19 (bvneg ~last_1_var_1_14~0)))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse19)))) (not (bvsgt .cse20 .cse6)) (bvslt .cse4 (bvmul .cse19 c_~var_1_14~0)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse20))))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse21 (bvneg ~last_1_var_1_14~0)) .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse21)))) (not (bvslt .cse4 (bvmul .cse21 c_~var_1_14~0)))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse22 (bvadd .cse7 .cse23 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse22)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse23)))) (not (bvslt .cse4 (bvmul .cse23 c_~var_1_14~0))) (not (bvsgt .cse22 .cse6)) (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse11) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse25 (bvadd .cse7 .cse24 (bvneg ~last_1_var_1_14~0)))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse24)))) (not (bvslt .cse4 (bvmul .cse24 c_~var_1_14~0))) (not (bvsgt .cse25 .cse6)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse25))))))))) .cse26 .cse27) (or (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse28)))) (not (bvslt .cse4 (bvmul .cse28 c_~var_1_14~0)))))) .cse29 .cse30) .cse31))) (or .cse0 (and .cse32 (or (let ((.cse43 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse62 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse61 (bvadd .cse7 .cse13 .cse62))) (or (bvsgt .cse61 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse61)))) (not (bvsgt (bvadd .cse7 .cse62 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse62 c_~var_1_14~0)))))))) (and (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse33 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse33))))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse33 c_~var_1_14~0)))))) .cse34 (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse35 (bvadd .cse7 .cse13 .cse37)) (.cse36 (bvadd .cse7 .cse37 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse35 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse36)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse35)))) (not (bvsgt .cse36 .cse6)) (bvslt .cse4 (bvmul .cse37 c_~var_1_14~0))))))) (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse39 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse38 (bvadd .cse7 .cse13 .cse39))) (or (not (bvsgt .cse38 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse38)))) (not (bvsgt (bvadd .cse7 .cse39 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse39 c_~var_1_14~0))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse40 (bvadd .cse7 .cse13 .cse41))) (or (bvsgt .cse40 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse40)))) (not (bvslt .cse4 (bvmul .cse41 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse41 (bvneg ~last_1_var_1_14~0)) .cse6)))))) .cse1) .cse42 (or .cse43 .cse1) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse45 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse44 (bvadd .cse7 .cse13 .cse45))) (or (bvsgt .cse44 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse44)))) (bvslt .cse4 (bvmul .cse45 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse45 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse46))))) (not (bvslt .cse4 (bvmul .cse46 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse46 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse1) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse47 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse48 (bvadd .cse7 .cse13 .cse47))) (or (bvsgt (bvadd .cse7 .cse47 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt .cse48 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse48)))) (not (bvslt .cse4 (bvmul .cse47 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse49 (bvadd .cse7 .cse13 .cse50))) (or (bvsgt .cse49 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse49)))) (not (bvslt .cse4 (bvmul .cse50 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse50 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse52 (bvadd .cse7 .cse13 .cse51))) (or (bvsgt (bvadd .cse7 .cse51 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt .cse52 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse52)))) (not (bvslt .cse4 (bvmul .cse51 c_~var_1_14~0))))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse53 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse54 (bvadd .cse7 .cse13 .cse53))) (or (bvsgt (bvadd .cse7 .cse53 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse54 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse54)))) (not (bvslt .cse4 (bvmul .cse53 c_~var_1_14~0))))))) .cse1) (or .cse43 .cse55) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse56 (bvadd .cse7 .cse13 .cse57))) (or (not (bvsgt .cse56 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse56)))) (not (bvsgt (bvadd .cse7 .cse57 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse57 c_~var_1_14~0)))))) .cse11) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse59 (bvadd .cse7 .cse13 .cse58))) (or (bvsgt (bvadd .cse7 .cse58 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse59 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse59)))) (bvslt .cse4 (bvmul .cse58 c_~var_1_14~0))))))) .cse60)) .cse26 .cse27))) (or .cse0 (and (or (let ((.cse65 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse91 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse90 (bvadd .cse7 .cse13 .cse91))) (or (bvsgt .cse90 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse90)))) (not (bvsgt (bvadd .cse7 .cse91 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse91)))))))) (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse63 (bvadd .cse7 .cse13 .cse64))) (or (not (bvsgt .cse63 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse63)))) (not (bvsgt (bvadd .cse7 .cse64 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse64)))))) .cse1 .cse8) (or .cse55 .cse65) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse67 (bvadd .cse7 .cse13 .cse66))) (or (bvsgt (bvadd .cse7 .cse66 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse67 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse67)))) (bvslt .cse4 (bvmul .cse2 .cse66)))))) .cse11) .cse68 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse70 (bvadd .cse7 .cse13 .cse69))) (or (not (bvslt .cse4 (bvmul .cse2 .cse69))) (bvsgt .cse70 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse70)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse69 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse71 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse72 (bvadd .cse7 .cse13 .cse71))) (or (bvsgt (bvadd .cse7 .cse71 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse71))) (bvsgt .cse72 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse72))))))))) (or .cse1 .cse65) .cse73 (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse75 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse74 (bvadd .cse7 .cse13 .cse75))) (or (not (bvsgt .cse74 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse74)))) (not (bvsgt (bvadd .cse7 .cse75 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse75))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse76 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse77 (bvadd .cse7 .cse13 .cse76))) (or (not (bvslt .cse4 (bvmul .cse2 .cse76))) (bvsgt .cse77 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse77)))) (not (bvsgt (bvadd .cse7 .cse76 (bvneg ~last_1_var_1_14~0)) .cse6)))))) .cse1) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse80 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse78 (bvadd .cse7 .cse13 .cse80)) (.cse79 (bvadd .cse7 .cse80 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse78 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse79)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse78)))) (not (bvsgt .cse79 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse80)))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse81 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse81 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse81))))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse81)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse83 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse82 (bvadd .cse7 .cse13 .cse83))) (or (bvsgt .cse82 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse82)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse83 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))) (bvslt .cse4 (bvmul .cse2 .cse83)))))) (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse84 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse84))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse84))))) (not (bvsgt (bvadd .cse7 .cse84 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse85 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse86 (bvadd .cse7 .cse13 .cse85))) (or (bvsgt (bvadd .cse7 .cse85 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse85))) (not (bvsgt .cse86 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse86)))))))) .cse1 .cse8) .cse87 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse88 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse89 (bvadd .cse7 .cse13 .cse88))) (or (bvsgt (bvadd .cse7 .cse88 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse88))) (not (bvsgt .cse89 .cse6)) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse89)))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1))) .cse26) .cse92)) (or .cse0 (and (or (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse93 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse93))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse93))))))) .cse29 .cse30) .cse94) (or (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse96 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse95 (bvadd .cse7 .cse96 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse95)))) (not (bvsgt .cse95 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse96)))))) .cse1 .cse8) .cse10 .cse97 (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse99 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse98 (bvadd .cse7 .cse99 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse98)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse99)))) (not (bvsgt .cse98 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse99)) (bvsgt ~last_1_var_1_14~0 .cse7)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse101 (bvadd .cse7 .cse100 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse100))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse101)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse100)))) (not (bvsgt .cse101 .cse6)) (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse11) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse102 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse103 (bvadd .cse7 .cse102 (bvneg ~last_1_var_1_14~0)))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse102)))) (not (bvsgt .cse103 .cse6)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse103))) (bvslt .cse4 (bvmul .cse2 .cse102))))))) (or .cse104 .cse1) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse105 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse105 (bvneg ~last_1_var_1_14~0)) .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse105)))) (bvslt .cse4 (bvmul .cse2 .cse105)))))) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse106 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse107 (bvadd .cse7 .cse106 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse106))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse106)))) (not (bvsgt .cse107 .cse6)) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse107)))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse108 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse108 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse108))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse108))))))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse109 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse110 (bvadd .cse7 .cse109 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse109))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse110)))) (not (bvsgt .cse110 .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1 .cse8)) .cse26))) (or (and (or .cse26 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse111 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse111))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse111 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))) (bvslt .cse4 (bvmul .cse2 .cse111))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse112 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse112))))) (not (bvsgt (bvadd .cse7 .cse112 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse112))))) .cse1 .cse8) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse113 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse113))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse113)))))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse114 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse114 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse114))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse114)))))))) .cse1 .cse8) .cse68 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse115 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse115))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse115))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse115 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))) .cse73 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse117 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse116 (bvadd .cse7 .cse117 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse116)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse117))))) (not (bvsgt .cse116 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse117)))))) .cse1 .cse8) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse118 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse118))))) (bvslt .cse4 (bvmul .cse2 .cse118))))) .cse1 .cse8) .cse87)) .cse92) .cse119) (or .cse119 (and (or (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse120 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse120)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse120 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse120 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse121 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse121 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse121)))) (bvslt .cse4 (bvmul .cse121 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse122 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse122 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse122)))) (not (bvslt .cse4 (bvmul .cse122 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse123 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse123)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse123 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvslt .cse4 (bvmul .cse123 c_~var_1_14~0))))))) .cse31) (or .cse26 .cse27 (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse124 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse124 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse124) .cse6)) (not (bvslt .cse4 (bvmul .cse124 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse125 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse126 (bvadd .cse7 .cse13 .cse125))) (or (bvsgt (bvadd .cse7 .cse125 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse126 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse126))) (not (bvslt .cse4 (bvmul .cse125 c_~var_1_14~0))))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse127 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse127 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse127) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse127 c_~var_1_14~0))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse130 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse128 (bvadd .cse7 .cse13 .cse130)) (.cse129 (bvadd .cse7 .cse130 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse128 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse129)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse128))) (not (bvslt .cse4 (bvmul .cse130 c_~var_1_14~0))) (not (bvsgt .cse129 .cse6)))))) .cse1 .cse8) (or .cse1 .cse9 .cse8) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse132 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse131 (bvadd .cse7 .cse13 .cse132))) (or (bvsgt .cse131 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse131))) (bvslt .cse4 (bvmul .cse132 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse132 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))))) .cse18 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse133 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse134 (bvadd .cse7 .cse13 .cse133))) (or (bvsgt (bvadd .cse7 .cse133 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse134 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse134))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse133 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse137 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse135 (bvadd .cse7 .cse13 .cse137)) (.cse136 (bvadd .cse7 .cse137 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse135 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse136)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse135))) (not (bvsgt .cse136 .cse6)) (bvslt .cse4 (bvmul .cse137 c_~var_1_14~0)))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse138 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse7 .cse13 .cse138) .cse6)) (not (bvsgt (bvadd .cse7 .cse138 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse138 c_~var_1_14~0)))))) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse139 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse7 .cse13 .cse139) .cse6)) (not (bvslt .cse4 (bvmul .cse139 c_~var_1_14~0))) (not (bvsgt (bvadd .cse7 .cse139 (bvneg ~last_1_var_1_14~0)) .cse6)))))) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse140 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse140 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse140) .cse6)) (bvslt .cse4 (bvmul .cse140 c_~var_1_14~0)) (bvsgt ~last_1_var_1_14~0 .cse7))))) (or .cse1 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse141 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse142 (bvadd .cse7 .cse13 .cse141))) (or (bvsgt (bvadd .cse7 .cse141 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse142 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse142))) (not (bvslt .cse4 (bvmul .cse141 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse143 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse143 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse143) .cse6)) (not (bvslt .cse4 (bvmul .cse143 c_~var_1_14~0))) (bvsgt ~last_1_var_1_14~0 .cse7))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse144 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse145 (bvadd .cse7 .cse13 .cse144))) (or (bvsgt (bvadd .cse7 .cse144 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse145 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse145))) (bvslt .cse4 (bvmul .cse144 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse147 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse146 (bvadd .cse7 .cse13 .cse147))) (or (bvsgt .cse146 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse146))) (not (bvsgt (bvadd .cse7 .cse147 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse147 c_~var_1_14~0)))))) .cse1 .cse8))))) (or (and (or .cse94 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse148 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse148))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse148)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse148 (bvneg ~last_1_var_1_14~0)) .cse6))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse149 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse149)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse7 .cse149 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse149))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse150 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse150))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse150 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse150))))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse151 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse7 .cse151 (bvneg ~last_1_var_1_14~0)) .cse6))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse151)))) (bvslt .cse4 (bvmul .cse2 .cse151))))))) (or .cse26 (and (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse152 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse152 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse152))) (not (bvsgt (bvadd .cse7 .cse13 .cse152) .cse6)) (bvsgt ~last_1_var_1_14~0 .cse7))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse153 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse153 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse153))) (not (bvsgt (bvadd .cse7 .cse13 .cse153) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse154 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse7 .cse13 .cse154) .cse6)) (not (bvsgt (bvadd .cse7 .cse154 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse154)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse156 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse155 (bvadd .cse7 .cse13 .cse156))) (or (bvsgt .cse155 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse155))) (not (bvsgt (bvadd .cse7 .cse156 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse156)))))) .cse1 .cse8) .cse97 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse157 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse158 (bvadd .cse7 .cse13 .cse157))) (or (bvsgt (bvadd .cse7 .cse157 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse158 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse158))) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse157)))))) .cse1 .cse8) (or .cse104 .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse159 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse160 (bvadd .cse7 .cse13 .cse159))) (or (bvsgt (bvadd .cse7 .cse159 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse159))) (bvsgt .cse160 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse160))) (not (bvsgt ~last_1_var_1_14~0 .cse7)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse161 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse161 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse161) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)) (bvslt .cse4 (bvmul .cse2 .cse161))))) .cse1 .cse8) (or .cse11 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse162 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse4 (bvmul .cse2 .cse162))) (not (bvsgt (bvadd .cse7 .cse13 .cse162) .cse6)) (not (bvsgt (bvadd .cse7 .cse162 (bvneg ~last_1_var_1_14~0)) .cse6)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse163 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse164 (bvadd .cse7 .cse13 .cse163))) (or (bvsgt (bvadd .cse7 .cse163 (bvneg ~last_1_var_1_14~0)) .cse6) (bvsgt .cse164 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse164))) (bvslt .cse4 (bvmul .cse2 .cse163)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse165 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse165 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvsgt (bvadd .cse7 .cse13 .cse165) .cse6)) (bvslt .cse4 (bvmul .cse2 .cse165)) (bvsgt ~last_1_var_1_14~0 .cse7)))) .cse11) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse166 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse167 (bvadd .cse7 .cse13 .cse166)) (.cse168 (bvadd .cse7 .cse166 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse4 (bvmul .cse2 .cse166))) (bvsgt .cse167 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse168)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse167))) (not (bvsgt .cse168 .cse6)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse171 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse169 (bvadd .cse7 .cse13 .cse171)) (.cse170 (bvadd .cse7 .cse171 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse169 .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse170)))) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse169))) (not (bvsgt .cse170 .cse6)) (bvslt .cse4 (bvmul .cse2 .cse171)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse172 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse173 (bvadd .cse7 .cse13 .cse172))) (or (bvsgt (bvadd .cse7 .cse172 (bvneg ~last_1_var_1_14~0)) .cse6) (not (bvslt .cse4 (bvmul .cse2 .cse172))) (bvsgt .cse173 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse173))))))) .cse1 .cse8) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse175 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse174 (bvadd .cse7 .cse13 .cse175))) (or (bvsgt .cse174 .cse6) (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse174))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse175 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7)))) (bvslt .cse4 (bvmul .cse2 .cse175))))))))) .cse119) (or .cse119 (and .cse32 (or (and .cse34 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse176 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse176))))) (not (bvslt .cse4 (bvmul .cse176 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse176 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))) (or .cse1 .cse8 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse177 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse177))))) (not (bvsgt (bvadd .cse7 .cse177 (bvneg ~last_1_var_1_14~0)) .cse6)) (bvslt .cse4 (bvmul .cse177 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse178 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse178))))) (bvslt .cse4 (bvmul .cse178 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse7 .cse178 (bvneg ~last_1_var_1_14~0)) .cse6)) (not (bvsgt ~last_1_var_1_14~0 .cse7))))))) .cse42 (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse179 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse179))))) (bvslt .cse4 (bvmul .cse179 c_~var_1_14~0))))) .cse1 .cse8) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse180 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse180))))) (not (bvslt .cse4 (bvmul .cse180 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse182 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse181 (bvadd .cse7 .cse182 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse181)))) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse182))))) (not (bvsgt .cse181 .cse6)) (bvslt .cse4 (bvmul .cse182 c_~var_1_14~0)))))) .cse1 .cse8) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse183 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse7 .cse183 (bvneg ~last_1_var_1_14~0)) .cse6) (not (= .cse2 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse7 .cse13 .cse183))))) (not (bvslt .cse4 (bvmul .cse183 c_~var_1_14~0)))))) .cse1 .cse8) .cse60) .cse26 .cse27)))))))) is different from true [2023-11-29 02:57:52,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:57:56,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:58:43,663 WARN L293 SmtUtils]: Spent 35.89s on a formula simplification that was a NOOP. DAG size: 302 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:58:47,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:58:51,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 02:59:59,296 WARN L293 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 447 DAG size of output: 1214 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:00:03,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:14,344 WARN L293 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 451 DAG size of output: 1218 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:01:18,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:23,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:25,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:27,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:28,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:29,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:32,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:36,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:38,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:41,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:43,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:01:50,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:02,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:06,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:10,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:14,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:02:16,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1]