./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_set.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:29:26,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:26,266 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:29:26,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:26,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:26,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:26,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:26,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:26,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:26,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:26,319 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:29:26,320 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:29:26,321 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:29:26,321 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:29:26,322 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:29:26,323 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:29:26,325 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:29:26,326 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:29:26,326 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:29:26,326 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:29:26,327 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:29:26,330 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:29:26,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:26,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:29:26,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:29:26,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:29:26,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:29:26,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:26,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:29:26,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:26,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:29:26,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:26,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:29:26,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:29:26,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:26,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:26,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:26,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:26,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:26,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:26,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:26,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:29:26,340 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:29:26,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:29:26,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:26,341 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:29:26,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:29:26,342 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/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_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 [2024-11-09 04:29:26,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:26,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:26,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:26,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:26,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:26,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/filter2_set.c Unable to find full path for "g++" [2024-11-09 04:29:28,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:29:29,024 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:29:29,024 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/sv-benchmarks/c/float-benchs/filter2_set.c [2024-11-09 04:29:29,039 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data/333ce7966/75fef32cfa674b40aae44f22667e9d97/FLAG848598ac8 [2024-11-09 04:29:29,058 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data/333ce7966/75fef32cfa674b40aae44f22667e9d97 [2024-11-09 04:29:29,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:29:29,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:29:29,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:29,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:29:29,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:29:29,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4272ef15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29, skipping insertion in model container [2024-11-09 04:29:29,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:29:29,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2024-11-09 04:29:29,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:29,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:29:29,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2024-11-09 04:29:29,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:29,376 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:29:29,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29 WrapperNode [2024-11-09 04:29:29,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:29,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:29,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:29:29,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:29:29,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,414 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-11-09 04:29:29,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:29,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:29:29,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:29:29,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:29:29,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:29:29,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:29:29,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:29:29,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:29:29,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (1/1) ... [2024-11-09 04:29:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:29,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:29:29,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:29:29,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:29:29,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:29:29,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:29:29,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:29:29,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:29:29,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:29:29,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:29:29,592 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:29:29,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:29:29,748 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 04:29:29,748 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:29:29,774 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:29:29,775 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:29:29,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:29 BoogieIcfgContainer [2024-11-09 04:29:29,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:29:29,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:29:29,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:29:29,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:29:29,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:29:29" (1/3) ... [2024-11-09 04:29:29,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd75aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:29, skipping insertion in model container [2024-11-09 04:29:29,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:29" (2/3) ... [2024-11-09 04:29:29,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd75aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:29, skipping insertion in model container [2024-11-09 04:29:29,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:29" (3/3) ... [2024-11-09 04:29:29,787 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_set.c [2024-11-09 04:29:29,807 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:29:29,808 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:29:29,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:29:29,894 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2edd9348, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:29:29,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:29:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:29:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:29:29,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:29,912 INFO L215 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:29,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:29,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -880914169, now seen corresponding path program 1 times [2024-11-09 04:29:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:29:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389949960] [2024-11-09 04:29:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:29:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:29:30,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:29:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:29:30,189 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:29:30,191 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:29:30,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:29:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:29:30,202 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 04:29:30,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:29:30,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:29:30 BoogieIcfgContainer [2024-11-09 04:29:30,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:29:30,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:29:30,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:29:30,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:29:30,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:29" (3/4) ... [2024-11-09 04:29:30,252 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 04:29:30,253 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:29:30,255 INFO L158 Benchmark]: Toolchain (without parser) took 1188.71ms. Allocated memory is still 148.9MB. Free memory was 117.7MB in the beginning and 70.7MB in the end (delta: 47.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-09 04:29:30,255 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 121.6MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:29:30,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.49ms. Allocated memory is still 148.9MB. Free memory was 117.3MB in the beginning and 104.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 04:29:30,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.15ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 102.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:29:30,259 INFO L158 Benchmark]: Boogie Preprocessor took 21.24ms. Allocated memory is still 148.9MB. Free memory was 102.8MB in the beginning and 101.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:29:30,260 INFO L158 Benchmark]: RCFGBuilder took 337.30ms. Allocated memory is still 148.9MB. Free memory was 101.5MB in the beginning and 89.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 04:29:30,261 INFO L158 Benchmark]: TraceAbstraction took 467.36ms. Allocated memory is still 148.9MB. Free memory was 88.5MB in the beginning and 71.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 04:29:30,262 INFO L158 Benchmark]: Witness Printer took 6.97ms. Allocated memory is still 148.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:29:30,265 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.36ms. Allocated memory is still 121.6MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.49ms. Allocated memory is still 148.9MB. Free memory was 117.3MB in the beginning and 104.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.15ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 102.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.24ms. Allocated memory is still 148.9MB. Free memory was 102.8MB in the beginning and 101.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.30ms. Allocated memory is still 148.9MB. Free memory was 101.5MB in the beginning and 89.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 467.36ms. Allocated memory is still 148.9MB. Free memory was 88.5MB in the beginning and 71.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 6.97ms. Allocated memory is still 148.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: 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 57, overapproximation of to_real at line 43, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55. Possible FailurePath: [L22] double E, E0, E1, S0, S1, S; [L23] double A1, A2, A3, B1, B2; [L24] int i; [L26] A1 = __VERIFIER_nondet_double() [L27] A2 = __VERIFIER_nondet_double() [L28] A3 = __VERIFIER_nondet_double() [L29] B1 = __VERIFIER_nondet_double() [L30] B2 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(A1 >= 0.69 && A1 <= 0.71) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L31] RET assume_abort_if_not(A1 >= 0.69 && A1 <= 0.71) [L32] CALL assume_abort_if_not(A2 >= -1.31 && A2 <= -1.29) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L32] RET assume_abort_if_not(A2 >= -1.31 && A2 <= -1.29) [L33] CALL assume_abort_if_not(A3 >= 1.09 && A3 <= 1.11) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L33] RET assume_abort_if_not(A3 >= 1.09 && A3 <= 1.11) [L34] CALL assume_abort_if_not(B1 >= 1.39 && B1 <= 1.41) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L34] RET assume_abort_if_not(B1 >= 1.39 && B1 <= 1.41) [L35] CALL assume_abort_if_not(B2 >= -0.71 && B2 <= -0.69) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L35] RET assume_abort_if_not(B2 >= -0.71 && B2 <= -0.69) [L38] E = __VERIFIER_nondet_double() [L39] E0 = __VERIFIER_nondet_double() [L40] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L40] RET assume_abort_if_not(E >= 0. && E <= 1.) [L41] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L41] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L43] S0 = 0 [L44] S = 0 [L46] i = 0 VAL [i=0] [L46] COND FALSE !(i <= 1000000) VAL [i=0] [L46] COND TRUE i <= 1000000 [L47] E1 = E0 [L48] E0 = E [L50] E = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) [L51] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E0=55, i=0] [L53] S1 = S0 [L54] S0 = S [L55] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L57] CALL __VERIFIER_assert(S >= -100. && S <= 100.) [L17] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 04:29:30,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:29:32,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:29:33,052 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 04:29:33,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:29:33,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:29:33,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:29:33,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:29:33,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:29:33,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:29:33,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:29:33,101 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:29:33,101 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:29:33,102 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:29:33,103 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:29:33,105 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:29:33,105 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:29:33,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:29:33,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:29:33,107 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:29:33,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:29:33,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:29:33,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:29:33,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:29:33,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:29:33,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:29:33,114 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:29:33,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:29:33,114 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:29:33,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:29:33,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:29:33,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:29:33,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:29:33,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:29:33,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:29:33,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:29:33,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:33,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:29:33,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:29:33,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:29:33,117 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:29:33,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:29:33,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:29:33,119 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:29:33,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/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_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 [2024-11-09 04:29:33,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:29:33,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:29:33,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:29:33,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:29:33,589 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:29:33,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/filter2_set.c Unable to find full path for "g++" [2024-11-09 04:29:36,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:29:36,350 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:29:36,351 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/sv-benchmarks/c/float-benchs/filter2_set.c [2024-11-09 04:29:36,359 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data/bddfb66e4/65f6be5c1e4b45b98bc21034722aee24/FLAGfe387acc3 [2024-11-09 04:29:36,372 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/data/bddfb66e4/65f6be5c1e4b45b98bc21034722aee24 [2024-11-09 04:29:36,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:29:36,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:29:36,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:36,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:29:36,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:29:36,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26286a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36, skipping insertion in model container [2024-11-09 04:29:36,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:29:36,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2024-11-09 04:29:36,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:36,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:29:36,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2024-11-09 04:29:36,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:29:36,678 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:29:36,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36 WrapperNode [2024-11-09 04:29:36,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:29:36,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:36,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:29:36,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:29:36,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,716 INFO L138 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-11-09 04:29:36,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:29:36,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:29:36,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:29:36,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:29:36,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:29:36,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:29:36,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:29:36,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:29:36,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (1/1) ... [2024-11-09 04:29:36,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:29:36,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:29:36,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:29:36,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:29:36,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:29:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:29:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:29:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:29:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:29:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:29:36,940 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:29:36,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:29:39,446 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 04:29:39,446 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:29:39,466 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:29:39,466 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:29:39,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:39 BoogieIcfgContainer [2024-11-09 04:29:39,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:29:39,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:29:39,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:29:39,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:29:39,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:29:36" (1/3) ... [2024-11-09 04:29:39,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c759ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:39, skipping insertion in model container [2024-11-09 04:29:39,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:29:36" (2/3) ... [2024-11-09 04:29:39,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c759ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:29:39, skipping insertion in model container [2024-11-09 04:29:39,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:29:39" (3/3) ... [2024-11-09 04:29:39,483 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_set.c [2024-11-09 04:29:39,501 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:29:39,502 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:29:39,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:29:39,586 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d9e5f7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:29:39,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:29:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:29:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 04:29:39,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:39,605 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:39,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1010834779, now seen corresponding path program 1 times [2024-11-09 04:29:39,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:29:39,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544610677] [2024-11-09 04:29:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:39,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:39,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:29:39,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:29:39,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 04:29:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:41,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 04:29:41,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:29:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 04:29:41,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:29:41,417 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:29:41,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544610677] [2024-11-09 04:29:41,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544610677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:29:41,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:29:41,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:29:41,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968523717] [2024-11-09 04:29:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:29:41,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 04:29:41,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:29:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 04:29:41,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:29:41,487 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 04:29:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:29:41,546 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2024-11-09 04:29:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 04:29:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-11-09 04:29:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:29:41,560 INFO L225 Difference]: With dead ends: 51 [2024-11-09 04:29:41,561 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 04:29:41,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:29:41,570 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:29:41,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:29:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 04:29:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 04:29:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:29:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-09 04:29:41,632 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 49 [2024-11-09 04:29:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:29:41,634 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-09 04:29:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 04:29:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-11-09 04:29:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 04:29:41,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:29:41,640 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:29:41,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 04:29:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:41,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:29:41,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:29:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash -517815771, now seen corresponding path program 1 times [2024-11-09 04:29:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:29:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312290524] [2024-11-09 04:29:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:29:41,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:29:41,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:29:41,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:29:41,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 04:29:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:29:52,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 04:29:53,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:40:01,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (let ((.cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse4 (fp.neg .cse2)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (.cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (.cse5 (fp.neg .cse3)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse1) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse3) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) .cse7)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse8))))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse8))))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse8) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse10))) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse11) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse11) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse0) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse2) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse8) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse8) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) (fp.neg .cse7))))))))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse3))) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse1))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse8) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse10))) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse0) (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) .cse7) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse4) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse9) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse8) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse5) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse10) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse8) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse11) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse8) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-09 04:40:36,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (.cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (.cse4 (fp.neg .cse2)) (.cse5 (fp.neg .cse3)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0)))) (or (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse1) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse3) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) .cse7)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse8))))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse8))))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse8) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse10))) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse11) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse11) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse0) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse2) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse8) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse8) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) (fp.neg .cse7))))))))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse3))) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse1))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse8) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse10))) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12)))))) is different from false [2024-11-09 04:40:38,218 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (.cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (.cse4 (fp.neg .cse2)) (.cse5 (fp.neg .cse3)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0)))) (or (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse1) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse3) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) .cse7)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse8))))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse8))))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse8) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse10))) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse11) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse11) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse0) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse2) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse8) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse8) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) (fp.neg .cse7))))))))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse3))) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse1))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse8) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse10))) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12)))))) is different from true [2024-11-09 04:40:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 04:40:38,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:40:38,220 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:40:38,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312290524] [2024-11-09 04:40:38,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312290524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:40:38,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:40:38,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 04:40:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051646882] [2024-11-09 04:40:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:40:38,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 04:40:38,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:40:38,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 04:40:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=130, Unknown=3, NotChecked=54, Total=272 [2024-11-09 04:40:38,227 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 17 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:40:44,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:40:46,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:40:48,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:40:50,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:40:52,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:40:54,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:40:57,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (and (fp.geq |c_ULTIMATE.start_main_~A1~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~B2~0#1| (fp.neg .cse1)) (fp.geq |c_ULTIMATE.start_main_~A3~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~A3~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~B1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~B2~0#1| (fp.neg .cse0)) (fp.geq |c_ULTIMATE.start_main_~A2~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq |c_ULTIMATE.start_main_~B1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse2) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse2) (fp.leq |c_ULTIMATE.start_main_~A2~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.leq |c_ULTIMATE.start_main_~A1~0#1| .cse1) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (let ((.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse7 (fp.neg .cse5)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (.cse8 (fp.neg .cse6)) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse15 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse4) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse5) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse7) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse8) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_main_~B2~0#1|)) .cse10)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse11))))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse11))))))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse11) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse12) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse13))) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse14) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse15))) (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse14) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse3) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse11) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse7) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse8) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse11) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_main_~B2~0#1|)) (fp.neg .cse10))))))))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse4))) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse11) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse12) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse13))) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse15))))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_6| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse5) (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse3) (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_main_~E1~0#1_6| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_main_~B2~0#1|)) .cse10) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse7) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse12) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse11) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse8) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse6) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse13) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_6| .cse11) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse14) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse11) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_6| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse15))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-09 04:40:59,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:01,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:03,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:05,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:07,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:09,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:11,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:13,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:15,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:17,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:19,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:21,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:23,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:41:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:41:23,952 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-09 04:41:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:41:24,172 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2024-11-09 04:41:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:41:24,173 INFO L225 Difference]: With dead ends: 34 [2024-11-09 04:41:24,174 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 04:41:24,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=87, Invalid=131, Unknown=4, NotChecked=84, Total=306 [2024-11-09 04:41:24,176 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 43.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:41:24,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 19 Unknown, 97 Unchecked, 43.0s Time] [2024-11-09 04:41:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 04:41:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 04:41:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 04:41:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-09 04:41:24,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 49 [2024-11-09 04:41:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:41:24,191 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-09 04:41:24,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:41:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-09 04:41:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 04:41:24,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:41:24,195 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:41:24,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 04:41:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:41:24,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:41:24,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:41:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 388700847, now seen corresponding path program 1 times [2024-11-09 04:41:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:41:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794731195] [2024-11-09 04:41:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:41:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 04:41:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:41:24,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 04:41:24,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2625e0-c893-490d-870d-a4511828bcc7/bin/utaipan-verify-YMUCfTKeje/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