./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:40:29,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:40:29,915 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:40:29,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:40:29,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:40:29,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:40:29,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:40:29,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:40:29,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:40:29,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:40:29,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:40:29,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:40:29,974 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:40:29,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:40:29,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:40:29,977 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:40:29,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:40:29,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:40:29,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:40:29,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:40:29,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:40:29,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:40:29,980 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:40:29,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:40:29,981 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:40:29,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:40:29,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:40:29,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:40:29,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:29,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:40:29,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:40:29,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:40:29,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:40:29,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:40:29,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:40:29,986 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:40:29,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:40:29,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:40:29,986 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:40:29,987 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2023-11-06 22:40:30,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:40:30,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:40:30,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:40:30,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:40:30,310 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:40:30,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2023-11-06 22:40:33,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:40:33,609 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:40:33,609 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2023-11-06 22:40:33,618 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data/03451d740/b79f79cf92994b78b9a8a5dc0c431471/FLAGbcbbe0dc6 [2023-11-06 22:40:33,634 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data/03451d740/b79f79cf92994b78b9a8a5dc0c431471 [2023-11-06 22:40:33,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:40:33,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:40:33,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:33,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:40:33,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:40:33,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23daadb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33, skipping insertion in model container [2023-11-06 22:40:33,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,673 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:40:33,827 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2023-11-06 22:40:33,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:33,856 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:40:33,876 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2023-11-06 22:40:33,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:33,898 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:40:33,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33 WrapperNode [2023-11-06 22:40:33,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:33,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:33,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:40:33,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:40:33,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,936 INFO L138 Inliner]: procedures = 15, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2023-11-06 22:40:33,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:33,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:40:33,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:40:33,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:40:33,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:40:33,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:40:33,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:40:33,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:40:33,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (1/1) ... [2023-11-06 22:40:33,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:34,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:34,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:40:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:40:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:40:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:40:34,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:40:34,146 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:40:34,148 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:40:34,395 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:40:34,402 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:40:34,402 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:40:34,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:34 BoogieIcfgContainer [2023-11-06 22:40:34,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:40:34,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:40:34,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:40:34,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:40:34,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:40:33" (1/3) ... [2023-11-06 22:40:34,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aab444f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:34, skipping insertion in model container [2023-11-06 22:40:34,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:33" (2/3) ... [2023-11-06 22:40:34,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aab444f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:34, skipping insertion in model container [2023-11-06 22:40:34,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:34" (3/3) ... [2023-11-06 22:40:34,419 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3.c [2023-11-06 22:40:34,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:40:34,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:40:34,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:40:34,513 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@35abb4e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:40:34,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:40:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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) [2023-11-06 22:40:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:40:34,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:34,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:34,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:40:34,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash 119513908, now seen corresponding path program 1 times [2023-11-06 22:40:34,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182498754] [2023-11-06 22:40:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:34,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182498754] [2023-11-06 22:40:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182498754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:34,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:34,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:40:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444490358] [2023-11-06 22:40:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:34,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:40:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:40:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:40:34,799 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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.0) internal successors, (8), 2 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) [2023-11-06 22:40:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:40:34,814 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-11-06 22:40:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:40:34,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) Word has length 8 [2023-11-06 22:40:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:40:34,822 INFO L225 Difference]: With dead ends: 25 [2023-11-06 22:40:34,822 INFO L226 Difference]: Without dead ends: 10 [2023-11-06 22:40:34,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:40:34,828 INFO L413 NwaCegarLoop]: 14 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, 14 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 [2023-11-06 22:40:34,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:40:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-06 22:40:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-06 22:40:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2023-11-06 22:40:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-11-06 22:40:34,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2023-11-06 22:40:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:40:34,855 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-11-06 22:40:34,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-11-06 22:40:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-11-06 22:40:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:40:34,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:34,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:34,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:40:34,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:40:34,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1186636597, now seen corresponding path program 1 times [2023-11-06 22:40:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869055480] [2023-11-06 22:40:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:40:34,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:40:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:40:34,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:40:34,969 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:40:34,971 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:40:34,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:40:34,977 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 22:40:34,981 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:40:35,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:40:35 BoogieIcfgContainer [2023-11-06 22:40:35,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:40:35,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:40:35,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:40:35,005 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:40:35,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:34" (3/4) ... [2023-11-06 22:40:35,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:40:35,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:40:35,009 INFO L158 Benchmark]: Toolchain (without parser) took 1370.07ms. Allocated memory is still 140.5MB. Free memory was 105.3MB in the beginning and 98.7MB in the end (delta: 6.6MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2023-11-06 22:40:35,010 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 111.1MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:35,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.30ms. Allocated memory is still 140.5MB. Free memory was 105.0MB in the beginning and 94.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:40:35,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.28ms. Allocated memory is still 140.5MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:40:35,012 INFO L158 Benchmark]: Boogie Preprocessor took 28.92ms. Allocated memory is still 140.5MB. Free memory was 92.8MB in the beginning and 91.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:35,013 INFO L158 Benchmark]: RCFGBuilder took 437.67ms. Allocated memory is still 140.5MB. Free memory was 91.4MB in the beginning and 81.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:40:35,013 INFO L158 Benchmark]: TraceAbstraction took 595.71ms. Allocated memory is still 140.5MB. Free memory was 80.6MB in the beginning and 98.7MB in the end (delta: -18.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:35,014 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 140.5MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:40:35,017 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.24ms. Allocated memory is still 111.1MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.30ms. Allocated memory is still 140.5MB. Free memory was 105.0MB in the beginning and 94.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.28ms. Allocated memory is still 140.5MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.92ms. Allocated memory is still 140.5MB. Free memory was 92.8MB in the beginning and 91.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 437.67ms. Allocated memory is still 140.5MB. Free memory was 91.4MB in the beginning and 81.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 595.71ms. Allocated memory is still 140.5MB. Free memory was 80.6MB in the beginning and 98.7MB in the end (delta: -18.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 140.5MB. Free memory is still 98.7MB. 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: 13]: 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 someBinaryFLOATComparisonOperation at line 51, overapproximation of to_real at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 34. Possible FailurePath: [L15] float pi = 3.14159 ; VAL [pi=314159/100000] [L21] float x = __VERIFIER_nondet_float() ; [L22] float octant1 = 0 ; [L23] float octant2 = pi/8 ; [L24] CALL assume_abort_if_not(x > octant1 && x < octant2) [L11] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, pi=314159/100000] [L24] RET assume_abort_if_not(x > octant1 && x < octant2) [L25] float oddExp = x ; [L26] float evenExp = 1.0 ; [L27] float term = x ; [L28] unsigned int count = 2 ; [L29] int multFactor = 0 ; [L30] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=118, pi=314159/100000, term=118, x=118] [L32] COND TRUE 1 [L34] term = term * (x/count) [L35] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L37] evenExp = evenExp + multFactor*term [L39] count++ [L41] term = term * (x/count) [L43] oddExp = oddExp + multFactor*term [L45] count++ [L47] temp = __VERIFIER_nondet_int() [L48] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=118] [L51] CALL __VERIFIER_assert( evenExp >= oddExp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L13] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:40:35,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:40:37,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:40:37,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:40:37,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:40:37,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:40:37,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:40:37,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:40:37,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:40:37,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:40:37,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:40:37,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:40:37,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:40:37,825 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:40:37,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:40:37,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:40:37,827 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:40:37,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:40:37,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:40:37,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:40:37,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:40:37,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:40:37,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:40:37,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:40:37,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:40:37,833 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:40:37,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:40:37,834 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:40:37,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:40:37,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:40:37,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:40:37,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:37,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:40:37,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:40:37,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:40:37,839 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:40:37,839 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:40:37,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:40:37,840 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:40:37,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:40:37,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:40:37,842 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:40:37,843 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:40:37,843 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2023-11-06 22:40:38,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:40:38,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:40:38,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:40:38,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:40:38,304 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:40:38,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2023-11-06 22:40:41,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:40:41,738 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:40:41,740 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2023-11-06 22:40:41,750 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data/746c1f5b6/79ed7f00f0f84346978196a3b7e8c0a7/FLAG87a8ded3c [2023-11-06 22:40:41,772 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/data/746c1f5b6/79ed7f00f0f84346978196a3b7e8c0a7 [2023-11-06 22:40:41,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:40:41,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:40:41,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:41,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:40:41,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:40:41,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:41" (1/1) ... [2023-11-06 22:40:41,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2448d7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:41, skipping insertion in model container [2023-11-06 22:40:41,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:40:41" (1/1) ... [2023-11-06 22:40:41,826 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:40:42,035 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2023-11-06 22:40:42,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:42,083 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:40:42,110 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2023-11-06 22:40:42,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:40:42,152 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:40:42,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42 WrapperNode [2023-11-06 22:40:42,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:40:42,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:42,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:40:42,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:40:42,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,216 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2023-11-06 22:40:42,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:40:42,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:40:42,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:40:42,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:40:42,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:40:42,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:40:42,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:40:42,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:40:42,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (1/1) ... [2023-11-06 22:40:42,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:40:42,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:42,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:40:42,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:40:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:40:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:40:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:40:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:40:42,472 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:40:42,474 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:40:45,063 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:40:45,068 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:40:45,069 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:40:45,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:45 BoogieIcfgContainer [2023-11-06 22:40:45,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:40:45,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:40:45,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:40:45,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:40:45,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:40:41" (1/3) ... [2023-11-06 22:40:45,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2276cca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:45, skipping insertion in model container [2023-11-06 22:40:45,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:40:42" (2/3) ... [2023-11-06 22:40:45,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2276cca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:40:45, skipping insertion in model container [2023-11-06 22:40:45,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:40:45" (3/3) ... [2023-11-06 22:40:45,081 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3.c [2023-11-06 22:40:45,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:40:45,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:40:45,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:40:45,160 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@635de4e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:40:45,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:40:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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) [2023-11-06 22:40:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:40:45,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:45,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:45,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:40:45,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 119513908, now seen corresponding path program 1 times [2023-11-06 22:40:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:45,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900213982] [2023-11-06 22:40:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:45,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:45,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:45,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:40:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:45,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:40:45,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:45,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:45,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900213982] [2023-11-06 22:40:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900213982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:45,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:45,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:40:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239513093] [2023-11-06 22:40:45,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:45,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:40:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:40:45,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:40:45,414 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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.0) internal successors, (8), 2 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) [2023-11-06 22:40:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:40:45,433 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-11-06 22:40:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:40:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) Word has length 8 [2023-11-06 22:40:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:40:45,442 INFO L225 Difference]: With dead ends: 25 [2023-11-06 22:40:45,442 INFO L226 Difference]: Without dead ends: 10 [2023-11-06 22:40:45,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:40:45,449 INFO L413 NwaCegarLoop]: 14 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, 14 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 [2023-11-06 22:40:45,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:40:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-06 22:40:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-06 22:40:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2023-11-06 22:40:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-11-06 22:40:45,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2023-11-06 22:40:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:40:45,484 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-11-06 22:40:45,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-11-06 22:40:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-11-06 22:40:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:40:45,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:45,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:45,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:45,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:45,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:40:45,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1186636597, now seen corresponding path program 1 times [2023-11-06 22:40:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922277579] [2023-11-06 22:40:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:45,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:45,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:45,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:45,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:40:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:47,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:40:47,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:10,509 WARN L839 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2023-11-06 22:41:12,570 WARN L861 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2023-11-06 22:42:00,764 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse7 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false [2023-11-06 22:42:18,026 WARN L839 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2023-11-06 22:42:20,094 WARN L861 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2023-11-06 22:42:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:20,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:42:20,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:42:20,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922277579] [2023-11-06 22:42:20,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922277579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:42:20,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008814298] [2023-11-06 22:42:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:20,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:42:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:42:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:42:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=21, Unknown=5, NotChecked=30, Total=72 [2023-11-06 22:42:20,101 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) [2023-11-06 22:42:24,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:42:26,676 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 [] [2023-11-06 22:42:28,682 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 [] [2023-11-06 22:42:30,954 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= c_~pi~0 .cse0) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-06 22:42:33,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:42:35,507 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 [] [2023-11-06 22:42:37,515 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 [] [2023-11-06 22:42:39,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:42:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:39,540 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2023-11-06 22:42:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:42:39,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 [2023-11-06 22:42:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:39,695 INFO L225 Difference]: With dead ends: 16 [2023-11-06 22:42:39,695 INFO L226 Difference]: Without dead ends: 12 [2023-11-06 22:42:39,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=33, Invalid=49, Unknown=6, NotChecked=68, Total=156 [2023-11-06 22:42:39,698 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:39,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 7 Unknown, 56 Unchecked, 15.3s Time] [2023-11-06 22:42:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-06 22:42:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-06 22:42:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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) [2023-11-06 22:42:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-11-06 22:42:39,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2023-11-06 22:42:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:39,703 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-11-06 22:42:39,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) [2023-11-06 22:42:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-11-06 22:42:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:42:39,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:39,704 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:39,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:39,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:42:39,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:42:39,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2054856368, now seen corresponding path program 1 times [2023-11-06 22:42:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:42:39,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169275891] [2023-11-06 22:42:39,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:39,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:42:39,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:42:39,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:42:39,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f16737ab-f6fa-445c-9734-b8fc83eb4358/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:43:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,826 WARN L260 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:43:01,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:37,701 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-06 22:44:31,661 WARN L839 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from false [2023-11-06 22:44:33,778 WARN L861 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from true