./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:53:17,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:53:17,410 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:53:17,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:53:17,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:53:17,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:53:17,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:53:17,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:53:17,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:53:17,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:53:17,459 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:53:17,459 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:53:17,460 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:53:17,460 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:53:17,460 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:53:17,460 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:53:17,460 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:53:17,460 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:53:17,460 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:53:17,461 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:53:17,461 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:53:17,461 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:53:17,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:53:17,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:53:17,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:53:17,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:53:17,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:53:17,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:53:17,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:53:17,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:53:17,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:53:17,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:53:17,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:53:17,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:53:17,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:53:17,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:53:17,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:53:17,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:53:17,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:17,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:53:17,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:53:17,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:53:17,466 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:53:17,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:53:17,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:53:17,466 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:53:17,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:53:17,467 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2024-11-14 03:53:17,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:53:17,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:53:17,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:53:17,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:53:17,796 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:53:17,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/filter1.c Unable to find full path for "g++" [2024-11-14 03:53:19,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:53:20,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:53:20,207 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/sv-benchmarks/c/float-benchs/filter1.c [2024-11-14 03:53:20,214 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data/7e057a393/1fb3b85a1dbd406aa524c5bab5d4a3fd/FLAG33eff56f4 [2024-11-14 03:53:20,537 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data/7e057a393/1fb3b85a1dbd406aa524c5bab5d4a3fd [2024-11-14 03:53:20,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:53:20,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:53:20,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:20,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:53:20,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:53:20,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b34ba37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20, skipping insertion in model container [2024-11-14 03:53:20,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:53:20,748 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_91af738d-1f56-48fa-a450-d220f68240e1/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2024-11-14 03:53:20,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:20,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:53:20,790 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_91af738d-1f56-48fa-a450-d220f68240e1/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2024-11-14 03:53:20,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:20,808 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:53:20,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20 WrapperNode [2024-11-14 03:53:20,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:20,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:20,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:53:20,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:53:20,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,844 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-11-14 03:53:20,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:20,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:53:20,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:53:20,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:53:20,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:53:20,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:53:20,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:53:20,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:53:20,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (1/1) ... [2024-11-14 03:53:20,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:20,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:20,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:53:20,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:53:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:53:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:53:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:53:20,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:53:21,025 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:53:21,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:53:21,164 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-14 03:53:21,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:53:21,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:53:21,250 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:53:21,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:21 BoogieIcfgContainer [2024-11-14 03:53:21,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:53:21,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:53:21,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:53:21,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:53:21,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:53:20" (1/3) ... [2024-11-14 03:53:21,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bca7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:21, skipping insertion in model container [2024-11-14 03:53:21,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:20" (2/3) ... [2024-11-14 03:53:21,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bca7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:21, skipping insertion in model container [2024-11-14 03:53:21,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:21" (3/3) ... [2024-11-14 03:53:21,262 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2024-11-14 03:53:21,281 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:53:21,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c that has 1 procedures, 7 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:53:21,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:53:21,372 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;@7a6c55b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:53:21,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:53:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:53:21,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:21,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:53:21,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:53:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2284202, now seen corresponding path program 1 times [2024-11-14 03:53:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:21,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258429381] [2024-11-14 03:53:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:53:21,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:53:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:53:21,560 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:53:21,562 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:53:21,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 03:53:21,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:53:21,570 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 03:53:21,590 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:53:21,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:53:21 BoogieIcfgContainer [2024-11-14 03:53:21,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:53:21,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:53:21,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:53:21,598 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:53:21,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:21" (3/4) ... [2024-11-14 03:53:21,601 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:53:21,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:53:21,604 INFO L158 Benchmark]: Toolchain (without parser) took 1062.89ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 55.3MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-14 03:53:21,605 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:53:21,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.36ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 81.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:53:21,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.95ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:53:21,608 INFO L158 Benchmark]: Boogie Preprocessor took 27.72ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.4MB in the end (delta: 812.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:53:21,608 INFO L158 Benchmark]: RCFGBuilder took 376.35ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 68.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:53:21,610 INFO L158 Benchmark]: TraceAbstraction took 342.40ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 55.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:53:21,610 INFO L158 Benchmark]: Witness Printer took 5.30ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 55.3MB in the end (delta: 197.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:53:21,615 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.31ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.36ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 81.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.95ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.72ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.4MB in the end (delta: 812.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 376.35ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 68.3MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 342.40ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 55.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 5.30ms. Allocated memory is still 117.4MB. Free memory was 55.5MB in the beginning and 55.3MB in the end (delta: 197.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryArithmeticDOUBLEoperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 31, overapproximation of to_real at line 25, overapproximation of to_real at line 34. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 VAL [i=0] [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L15] COND FALSE !(!cond) [L31] RET assume_abort_if_not(E0 >= -1. && E0 <= 1.) [L33] COND FALSE !(__VERIFIER_nondet_int()) [L37] S = 0.999 * S + E0 - E1 [L39] E1 = E0 [L41] CALL __VERIFIER_assert(S >= -10000. && S <= 10000.) [L17] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, 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=7occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 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-14 03:53:21,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:53:24,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:53:24,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 03:53:24,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:53:24,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:53:24,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:53:24,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:53:24,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:53:24,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:53:24,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:53:24,649 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:53:24,649 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:53:24,650 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:53:24,650 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:53:24,650 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:53:24,650 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:53:24,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:53:24,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:53:24,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:53:24,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:53:24,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:53:24,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:53:24,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:53:24,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:53:24,652 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:53:24,652 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:53:24,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:53:24,652 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:53:24,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:53:24,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:53:24,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:53:24,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:53:24,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:53:24,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:53:24,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:53:24,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:24,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:53:24,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:53:24,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:53:24,663 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:53:24,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:53:24,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:53:24,664 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:53:24,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f607249994cf0ffcacc9c07747c47cb351729bf7053d82a0bf430a6b6707eef [2024-11-14 03:53:25,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:53:25,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:53:25,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:53:25,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:53:25,117 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:53:25,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/filter1.c Unable to find full path for "g++" [2024-11-14 03:53:27,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:53:28,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:53:28,048 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/sv-benchmarks/c/float-benchs/filter1.c [2024-11-14 03:53:28,062 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data/43e97403e/052b2010900a49e98cc852cc38dd7bfd/FLAG0afb6e7cf [2024-11-14 03:53:28,089 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/data/43e97403e/052b2010900a49e98cc852cc38dd7bfd [2024-11-14 03:53:28,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:53:28,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:53:28,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:28,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:53:28,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:53:28,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44efb0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28, skipping insertion in model container [2024-11-14 03:53:28,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:53:28,342 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_91af738d-1f56-48fa-a450-d220f68240e1/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2024-11-14 03:53:28,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:28,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:53:28,405 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_91af738d-1f56-48fa-a450-d220f68240e1/sv-benchmarks/c/float-benchs/filter1.c[627,640] [2024-11-14 03:53:28,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:28,441 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:53:28,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28 WrapperNode [2024-11-14 03:53:28,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:28,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:28,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:53:28,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:53:28,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,494 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-11-14 03:53:28,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:28,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:53:28,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:53:28,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:53:28,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:53:28,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:53:28,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:53:28,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:53:28,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (1/1) ... [2024-11-14 03:53:28,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:28,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:28,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:53:28,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:53:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:53:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:53:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:53:28,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:53:28,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:53:28,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:53:30,967 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-14 03:53:30,967 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:53:30,978 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:53:30,978 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:53:30,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:30 BoogieIcfgContainer [2024-11-14 03:53:30,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:53:30,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:53:30,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:53:30,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:53:30,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:53:28" (1/3) ... [2024-11-14 03:53:30,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86913a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:30, skipping insertion in model container [2024-11-14 03:53:30,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:28" (2/3) ... [2024-11-14 03:53:30,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86913a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:30, skipping insertion in model container [2024-11-14 03:53:30,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:30" (3/3) ... [2024-11-14 03:53:30,992 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c [2024-11-14 03:53:31,012 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:53:31,014 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG filter1.c that has 1 procedures, 15 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:53:31,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:53:31,091 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;@74fd949f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:53:31,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:53:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:53:31,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:31,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:31,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:53:31,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2024-11-14 03:53:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:53:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597850837] [2024-11-14 03:53:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:53:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:53:31,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:53:31,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 03:53:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:31,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 03:53:31,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:31,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:53:31,254 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:53:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597850837] [2024-11-14 03:53:31,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597850837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:31,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647739873] [2024-11-14 03:53:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:31,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:53:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:53:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:53:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:53:31,299 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:31,314 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-11-14 03:53:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:53:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:53:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:31,324 INFO L225 Difference]: With dead ends: 28 [2024-11-14 03:53:31,325 INFO L226 Difference]: Without dead ends: 11 [2024-11-14 03:53:31,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:53:31,331 INFO L432 NwaCegarLoop]: 16 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, 16 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:31,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:53:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-14 03:53:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-14 03:53:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-14 03:53:31,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2024-11-14 03:53:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:31,365 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-14 03:53:31,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-14 03:53:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:53:31,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:31,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:31,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 03:53:31,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:53:31,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:53:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2024-11-14 03:53:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:53:31,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093398417] [2024-11-14 03:53:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:31,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:53:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:53:31,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:53:31,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 03:53:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:31,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:53:31,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:31,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:53:31,911 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:53:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093398417] [2024-11-14 03:53:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093398417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:53:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334540739] [2024-11-14 03:53:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:31,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:53:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:53:31,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:53:31,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:53:31,920 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:32,542 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-14 03:53:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:53:32,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:53:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:32,545 INFO L225 Difference]: With dead ends: 20 [2024-11-14 03:53:32,545 INFO L226 Difference]: Without dead ends: 18 [2024-11-14 03:53:32,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:53:32,547 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:32,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:53:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-14 03:53:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2024-11-14 03:53:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-14 03:53:32,552 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2024-11-14 03:53:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:32,553 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-14 03:53:32,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-14 03:53:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:53:32,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:32,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:32,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 03:53:32,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:53:32,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:53:32,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -274941459, now seen corresponding path program 1 times [2024-11-14 03:53:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:53:32,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360877679] [2024-11-14 03:53:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:53:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:53:32,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:53:32,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 03:53:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:33,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:53:33,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:34,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:53:34,467 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:53:34,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360877679] [2024-11-14 03:53:34,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360877679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:34,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:34,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:53:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728536951] [2024-11-14 03:53:34,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:34,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:53:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:53:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:53:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:53:34,469 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:38,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:53:40,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:53:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:40,371 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-14 03:53:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:53:40,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:53:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:40,418 INFO L225 Difference]: With dead ends: 27 [2024-11-14 03:53:40,418 INFO L226 Difference]: Without dead ends: 25 [2024-11-14 03:53:40,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:53:40,419 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:40,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2024-11-14 03:53:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-14 03:53:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2024-11-14 03:53:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-14 03:53:40,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 9 [2024-11-14 03:53:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:40,434 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-14 03:53:40,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-14 03:53:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:53:40,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:40,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:40,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 03:53:40,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:53:40,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:53:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1003719872, now seen corresponding path program 1 times [2024-11-14 03:53:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:53:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518010523] [2024-11-14 03:53:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:40,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:53:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:53:40,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:53:40,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 03:53:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:41,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:53:41,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:05,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:16,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2024-11-14 03:54:18,747 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2024-11-14 03:54:41,487 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1)))) is different from false [2024-11-14 03:54:43,520 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1)))) is different from true [2024-11-14 03:55:10,359 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2024-11-14 03:56:26,562 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse2))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3))))))) is different from true [2024-11-14 03:57:25,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) (fp.neg .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) .cse2)))))))) is different from false [2024-11-14 03:57:27,541 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) (fp.neg .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) .cse2)))))))) is different from true [2024-11-14 03:57:38,051 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse1)))))) is different from true [2024-11-14 03:57:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-14 03:57:38,052 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:57:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518010523] [2024-11-14 03:57:38,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518010523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [812780793] [2024-11-14 03:57:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:38,053 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:57:38,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:57:38,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:57:38,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-14 03:57:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:38,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:57:38,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:11,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:59:07,262 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3))))))) is different from true [2024-11-14 04:00:23,448 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3)) (.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1)))))) is different from true [2024-11-14 04:00:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 04:00:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [812780793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:00:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132387787] [2024-11-14 04:00:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:56,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:00:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:00:56,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:00:56,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91af738d-1f56-48fa-a450-d220f68240e1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:00:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:59,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:00:59,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:20,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:15,864 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) (fp.neg .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3))))))) is different from true [2024-11-14 04:03:31,410 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 (fp.neg .cse0))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse0)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse0)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E0~0#1|) (fp.neg .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3))))))) is different from true [2024-11-14 04:04:09,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~E0~0#1_18| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_18| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_18|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_18| .cse1)))))) is different from false [2024-11-14 04:04:11,556 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~E0~0#1_18| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_18| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_18|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_18| .cse1)))))) is different from true [2024-11-14 04:04:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-14 04:04:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132387787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:04:16,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:04:16,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 10, 10, 10] total 27 [2024-11-14 04:04:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451526156] [2024-11-14 04:04:16,076 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:04:16,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 04:04:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:04:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 04:04:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=169, Unknown=36, NotChecked=418, Total=702 [2024-11-14 04:04:16,078 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:18,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:04:19,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:04:21,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (.cse0 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_18| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_18| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_18|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_18| .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:04:24,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse4)) (.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_18| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_18| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_18|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_18| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) .cse4))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:04:26,863 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse4)) (.cse0 (fp.neg .cse3)) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_18| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_18| .cse0)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_18|) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_18| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_9| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_9| .cse3)) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |v_ULTIMATE.start_main_~E0~0#1_9|) .cse4))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:04:46,910 WARN L286 SmtUtils]: Spent 16.53s on a formula simplification. DAG size of input: 43 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:04:48,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:07,257 WARN L286 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 31 DAG size of output: 10 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:05:09,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:10,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:14,518 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse7 .cse5)) (.cse0 (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 (fp.neg .cse4)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (= |c_ULTIMATE.start_main_~S~0#1| .cse5) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2))))))) is different from true [2024-11-14 04:05:16,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:05:18,623 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-14 04:05:20,627 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-14 04:05:22,629 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-14 04:05:25,581 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-14 04:05:27,586 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-14 04:05:31,284 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from true [2024-11-14 04:05:32,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:34,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:05:36,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:05:38,344 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse2) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (= |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:05:40,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:42,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:05:45,634 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.neg .cse3)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse7 (fp.neg .cse6)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (and (let ((.cse1 (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse4)) (.cse0 (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse3))) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse0 .cse1) (and .cse2 (or (not .cse1) (not .cse0))))) (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse4) (or .cse2 (let ((.cse5 (fp.mul c_currentRoundingMode .cse8 .cse9))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse7) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4))))))) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (= |c_ULTIMATE.start_main_~S~0#1| .cse9) (or .cse2 (let ((.cse10 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse10 .cse7) (fp.leq .cse10 .cse6)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:05:47,718 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 [0] [2024-11-14 04:05:49,787 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 [1] [2024-11-14 04:05:53,376 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 .cse4)) (.cse2 (fp.neg .cse6)) (.cse0 (fp.neg .cse3)) (.cse1 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq |c_ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq .cse1 .cse2) (fp.leq |c_ULTIMATE.start_main_~E1~0#1| .cse3) (= |c_ULTIMATE.start_main_~S~0#1| .cse4) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse6) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse2) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (fp.leq .cse1 .cse6) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-14 04:05:55,579 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse1 (fp.neg .cse4)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2))))))) is different from true [2024-11-14 04:06:14,022 WARN L286 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 29 DAG size of output: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:06:16,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~S~0#1|)) (.cse4 (fp.neg .cse1)) (.cse2 (fp.neg .cse3))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_13| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_13|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_13| .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_13| .cse3)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_17| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~E0~0#1_17|) |c_ULTIMATE.start_main_~E1~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_17| .cse3)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_17| .cse2))))))) is different from true [2024-11-14 04:06:18,588 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 [0, 1] [2024-11-14 04:06:20,752 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 [0, 1] [2024-11-14 04:06:31,934 WARN L286 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:06:34,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:06:36,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:06:55,712 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 29 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:06:57,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:00,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:07:02,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse5 (fp.neg .cse3)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (and (or .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse4 (fp.neg .cse1))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))))))) (or .cse0 (let ((.cse7 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse7 .cse5) (fp.leq .cse7 .cse3))))))) is different from false [2024-11-14 04:07:04,224 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse5 (fp.neg .cse3)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (and (or .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse4 (fp.neg .cse1))) (and (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse1)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse5) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse1)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse4)))))))) (or .cse0 (let ((.cse7 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse7 .cse5) (fp.leq .cse7 .cse3))))))) is different from true [2024-11-14 04:07:06,678 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 [0, 1] [2024-11-14 04:07:48,360 WARN L286 SmtUtils]: Spent 34.84s on a formula simplification. DAG size of input: 54 DAG size of output: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:07:50,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse4)) (.cse5 (fp.neg .cse2)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse5)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse5)))) (fp.leq .cse0 .cse4)))) is different from false [2024-11-14 04:07:52,506 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.neg .cse4)) (.cse5 (fp.neg .cse2)) (.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 |c_ULTIMATE.start_main_~S~0#1|) |c_ULTIMATE.start_main_~E0~0#1|) |c_ULTIMATE.start_main_~E1~0#1|))) (and (fp.geq .cse0 .cse1) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse5)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse1) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse5)))) (fp.leq .cse0 .cse4)))) is different from true [2024-11-14 04:07:54,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:07:56,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:07:58,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:08:00,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:08:02,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:08:04,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:08:06,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:08:08,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:08:10,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 04:08:12,536 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 10000.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse0 (fp.neg .cse2)) (.cse4 (fp.neg .cse3))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~E1~0#1_8| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~E1~0#1_8| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |ULTIMATE.start_main_~E0~0#1|) |v_ULTIMATE.start_main_~E1~0#1_8|)) (fp.leq |v_ULTIMATE.start_main_~E1~0#1_8| .cse2) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse2))) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse2) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse3) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| .cse0) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse3) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (forall ((|v_ULTIMATE.start_main_~E0~0#1_8| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~E0~0#1_8|) |c_ULTIMATE.start_main_~E0~0#1|) .cse4) (not (fp.leq |v_ULTIMATE.start_main_~E0~0#1_8| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~E0~0#1_8| .cse0)))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| .cse4) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-14 04:08:15,361 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 [1] [2024-11-14 04:08:17,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:08:24,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:08:25,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 04:08:41,772 WARN L286 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:08:45,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1]