./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:13:56,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:13:56,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 22:13:56,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:13:56,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:13:56,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:13:56,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:13:56,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:13:56,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:13:56,272 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:13:56,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:13:56,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:13:56,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:13:56,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:13:56,273 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:13:56,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:13:56,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:13:56,274 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:13:56,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 22:13:56,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:13:56,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:13:56,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:13:56,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:13:56,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:13:56,276 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:13:56,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:13:56,276 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:13:56,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:13:56,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:13:56,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:13:56,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:13:56,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:13:56,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:13:56,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:13:56,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:13:56,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 22:13:56,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 22:13:56,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:13:56,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:13:56,279 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:13:56,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:13:56,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:13:56,279 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:13:56,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:13:56,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:13:56,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:13:56,496 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:13:56,497 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:13:56,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 22:13:57,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:13:57,828 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:13:57,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 22:13:57,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a1b241c/bfb8cf1e454e4c08a837dcac746566cc/FLAG80639c0c6 [2023-11-22 22:13:57,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a1b241c/bfb8cf1e454e4c08a837dcac746566cc [2023-11-22 22:13:57,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:13:57,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:13:57,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:13:57,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:13:57,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:13:57,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:57" (1/1) ... [2023-11-22 22:13:57,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220d9801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:57, skipping insertion in model container [2023-11-22 22:13:57,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:13:57" (1/1) ... [2023-11-22 22:13:57,905 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:13:58,005 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 22:13:58,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:13:58,027 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:13:58,036 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 22:13:58,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:13:58,055 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:13:58,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58 WrapperNode [2023-11-22 22:13:58,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:13:58,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:13:58,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:13:58,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:13:58,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,079 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 50 [2023-11-22 22:13:58,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:13:58,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:13:58,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:13:58,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:13:58,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,087 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,093 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 22:13:58,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:13:58,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:13:58,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:13:58,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:13:58,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (1/1) ... [2023-11-22 22:13:58,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:13:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:13:58,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 22:13:58,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 22:13:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:13:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2023-11-22 22:13:58,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2023-11-22 22:13:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 22:13:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:13:58,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:13:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2023-11-22 22:13:58,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2023-11-22 22:13:58,203 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:13:58,205 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:13:58,285 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:13:58,301 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:13:58,302 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 22:13:58,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:58 BoogieIcfgContainer [2023-11-22 22:13:58,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:13:58,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:13:58,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:13:58,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:13:58,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:13:57" (1/3) ... [2023-11-22 22:13:58,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729f354b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:58, skipping insertion in model container [2023-11-22 22:13:58,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:13:58" (2/3) ... [2023-11-22 22:13:58,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729f354b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:13:58, skipping insertion in model container [2023-11-22 22:13:58,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:58" (3/3) ... [2023-11-22 22:13:58,308 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade.c [2023-11-22 22:13:58,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:13:58,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:13:58,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:13:58,360 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68b4c73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:13:58,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:13:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 22:13:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 22:13:58,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:13:58,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:13:58,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:13:58,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:13:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash -943234999, now seen corresponding path program 1 times [2023-11-22 22:13:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:13:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123329508] [2023-11-22 22:13:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:13:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:13:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:13:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 22:13:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:13:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:13:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:13:58,482 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-22 22:13:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:13:58,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123329508] [2023-11-22 22:13:58,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123329508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:13:58,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:13:58,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:13:58,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565100431] [2023-11-22 22:13:58,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:13:58,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 22:13:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:13:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 22:13:58,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:13:58,506 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 22:13:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:13:58,523 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-22 22:13:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 22:13:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-22 22:13:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:13:58,530 INFO L225 Difference]: With dead ends: 46 [2023-11-22 22:13:58,530 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 22:13:58,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-22 22:13:58,534 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:13:58,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:13:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 22:13:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-22 22:13:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 22:13:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-22 22:13:58,557 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2023-11-22 22:13:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:13:58,557 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-22 22:13:58,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 22:13:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-22 22:13:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 22:13:58,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:13:58,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:13:58,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 22:13:58,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:13:58,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:13:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1964303353, now seen corresponding path program 1 times [2023-11-22 22:13:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:13:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659946854] [2023-11-22 22:13:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:13:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:13:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 22:13:58,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 22:13:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 22:13:58,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 22:13:58,651 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 22:13:58,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 22:13:58,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 22:13:58,657 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-22 22:13:58,660 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 22:13:58,688 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 22:13:58,689 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2023-11-22 22:13:58,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:13:58 BoogieIcfgContainer [2023-11-22 22:13:58,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 22:13:58,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 22:13:58,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 22:13:58,700 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 22:13:58,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:13:58" (3/4) ... [2023-11-22 22:13:58,702 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 22:13:58,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 22:13:58,703 INFO L158 Benchmark]: Toolchain (without parser) took 848.55ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 113.1MB in the end (delta: -39.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:13:58,704 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:13:58,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.89ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 107.0MB in the end (delta: -33.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-11-22 22:13:58,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.07ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:13:58,705 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 103.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 22:13:58,705 INFO L158 Benchmark]: RCFGBuilder took 200.32ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 92.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 22:13:58,706 INFO L158 Benchmark]: TraceAbstraction took 395.83ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 113.1MB in the end (delta: -21.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-22 22:13:58,706 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 142.6MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:13:58,707 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.13ms. Allocated memory is still 109.1MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.89ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 107.0MB in the end (delta: -33.4MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.07ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 103.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 200.32ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 92.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 395.83ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 113.1MB in the end (delta: -21.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 142.6MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 35. Possible FailurePath: [L20] const double Pi=3.141592653589793238; [L47] double a, r; [L49] a = __VERIFIER_nondet_double() [L50] CALL assume_abort_if_not(a >= -1.79e308 && a <= 1.79e308) [L15] COND FALSE !(!cond) VAL [Pi=1570796326794896619/500000000000000000, \old(cond)=1, cond=1] [L50] RET assume_abort_if_not(a >= -1.79e308 && a <= 1.79e308) [L52] CALL, EXPR ARCTAN(a) [L41] COND FALSE !(x < 0) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L42] CALL, EXPR ARCTAN_POS(x) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55] [L35] COND TRUE x > 1. VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L35] CALL, EXPR ARCTAN_0_1(1. / x) VAL [Pi=1570796326794896619/500000000000000000] [L30] CALL, EXPR PADE_2_2(x) [L24] double x_2 = x*x; [L25] return 1. - x_2 / (3. + 9./5.*x_2); [L30] RET, EXPR PADE_2_2(x) [L30] return x*PADE_2_2(x); [L35] RET, EXPR ARCTAN_0_1(1. / x) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L35] return Pi / 2. - ARCTAN_0_1(1. / x); [L42] RET, EXPR ARCTAN_POS(x) VAL [Pi=1570796326794896619/500000000000000000, \old(x)=55, x=55] [L42] return ARCTAN_POS(x); [L52] RET, EXPR ARCTAN(a) [L52] r = ARCTAN(a) [L54] CALL __VERIFIER_assert(r >= -1.571 && r <= 1.571) [L17] COND TRUE !(cond) VAL [Pi=1570796326794896619/500000000000000000, \old(cond)=0, cond=0] [L17] reach_error() VAL [Pi=1570796326794896619/500000000000000000, \old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 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-22 22:13:58,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:14:00,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:14:00,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 22:14:00,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:14:00,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:14:00,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:14:00,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:14:00,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:14:00,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:14:00,778 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:14:00,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:14:00,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:14:00,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:14:00,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:14:00,782 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:14:00,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:14:00,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:14:00,784 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:14:00,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:14:00,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:14:00,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:14:00,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:14:00,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:14:00,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 22:14:00,786 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 22:14:00,786 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 22:14:00,786 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:14:00,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:14:00,786 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:14:00,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:14:00,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:14:00,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:14:00,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:14:00,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:14:00,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:14:00,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:14:00,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:14:00,790 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 22:14:00,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 22:14:00,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:14:00,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:14:00,796 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:14:00,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:14:00,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:14:00,796 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 22:14:00,796 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03d4f02c4d6708ec7407dd5809f77bd3b86d46b08411c69d0afecaf50bc68872 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:14:01,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:14:01,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:14:01,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:14:01,087 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:14:01,087 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:14:01,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 22:14:02,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:14:02,476 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:14:02,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c [2023-11-22 22:14:02,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0bf6131d/b19872a828de4b9786165ea5a115d4d5/FLAG886ad38b9 [2023-11-22 22:14:02,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0bf6131d/b19872a828de4b9786165ea5a115d4d5 [2023-11-22 22:14:02,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:14:02,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:14:02,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:14:02,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:14:02,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:14:02,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3247470d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02, skipping insertion in model container [2023-11-22 22:14:02,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,535 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:14:02,679 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 22:14:02,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:14:02,707 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:14:02,718 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/arctan_Pade.c[665,678] [2023-11-22 22:14:02,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:14:02,748 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:14:02,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02 WrapperNode [2023-11-22 22:14:02,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:14:02,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:14:02,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:14:02,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:14:02,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,792 INFO L138 Inliner]: procedures = 19, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 51 [2023-11-22 22:14:02,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:14:02,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:14:02,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:14:02,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:14:02,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,809 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,823 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 22:14:02,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:14:02,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:14:02,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:14:02,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:14:02,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (1/1) ... [2023-11-22 22:14:02,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:14:02,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:14:02,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 22:14:03,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 22:14:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:14:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 22:14:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_POS [2023-11-22 22:14:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_POS [2023-11-22 22:14:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:14:03,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:14:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure ARCTAN_0_1 [2023-11-22 22:14:03,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ARCTAN_0_1 [2023-11-22 22:14:03,116 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:14:03,123 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:14:09,056 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:14:09,083 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:14:09,083 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 22:14:09,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:09 BoogieIcfgContainer [2023-11-22 22:14:09,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:14:09,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:14:09,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:14:09,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:14:09,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:14:02" (1/3) ... [2023-11-22 22:14:09,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435b27ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:09, skipping insertion in model container [2023-11-22 22:14:09,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:02" (2/3) ... [2023-11-22 22:14:09,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435b27ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:09, skipping insertion in model container [2023-11-22 22:14:09,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:09" (3/3) ... [2023-11-22 22:14:09,092 INFO L112 eAbstractionObserver]: Analyzing ICFG arctan_Pade.c [2023-11-22 22:14:09,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:14:09,103 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:14:09,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:14:09,147 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@be02789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:14:09,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:14:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 22:14:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 22:14:09,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:09,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:09,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:09,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -943234999, now seen corresponding path program 1 times [2023-11-22 22:14:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:14:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886141675] [2023-11-22 22:14:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:09,173 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-22 22:14:09,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:14:09,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 22:14:09,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 22:14:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:10,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 22:14:10,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:14:10,964 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-22 22:14:10,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:14:10,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:14:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886141675] [2023-11-22 22:14:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886141675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:14:10,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:14:10,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:14:10,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529459903] [2023-11-22 22:14:10,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:14:10,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 22:14:10,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:14:11,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 22:14:11,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:14:11,024 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 22:14:13,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:14:13,624 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-22 22:14:13,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 22:14:13,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-22 22:14:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:14:13,631 INFO L225 Difference]: With dead ends: 46 [2023-11-22 22:14:13,631 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 22:14:13,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-22 22:14:13,639 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-22 22:14:13,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-11-22 22:14:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 22:14:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-22 22:14:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 22:14:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-22 22:14:13,685 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2023-11-22 22:14:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:14:13,685 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-22 22:14:13,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 22:14:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-22 22:14:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 22:14:13,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:13,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:13,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-22 22:14:13,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 22:14:13,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:13,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash 642770955, now seen corresponding path program 1 times [2023-11-22 22:14:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:14:13,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309982432] [2023-11-22 22:14:13,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:13,906 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-22 22:14:13,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:14:13,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 22:14:13,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 22:14:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:35,106 WARN L260 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 22:14:35,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:15:03,357 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= |c_ARCTAN_0_1_#res#1| (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse0 (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| |c_ARCTAN_0_1_#in~x#1|))) (fp.div c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-22 22:15:05,549 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= |c_ARCTAN_0_1_#res#1| (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse0 (fp.mul c_currentRoundingMode |c_ARCTAN_0_1_#in~x#1| |c_ARCTAN_0_1_#in~x#1|))) (fp.div c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-22 22:15:10,944 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:15:16,084 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:15:21,263 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:15:26,441 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:15:36,655 WARN L293 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:15:39,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ARCTAN_POS_#t~ret5| (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ARCTAN_POS_#in~x|))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 (let ((.cse2 (fp.mul c_currentRoundingMode .cse0 .cse0))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2)))))))) (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (fp.gt |c_ARCTAN_POS_#in~x| .cse1) (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-22 22:15:41,602 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ARCTAN_POS_#t~ret5| (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ARCTAN_POS_#in~x|))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 (let ((.cse2 (fp.mul c_currentRoundingMode .cse0 .cse0))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2)))))))) (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (fp.gt |c_ARCTAN_POS_#in~x| .cse1) (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-22 22:15:47,031 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:15:57,044 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:02,410 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:07,816 WARN L293 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:13,662 WARN L293 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:16,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (fp.gt |c_ARCTAN_POS_#in~x| .cse0) (= c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0))) (= (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_~Pi~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |c_ARCTAN_POS_#in~x|))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse0 (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 .cse1))) (fp.div c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse2)))))))) |c_ARCTAN_POS_#res|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-22 22:16:23,005 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:32,907 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:38,210 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:43,579 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:49,349 WARN L293 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:16:54,796 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:17:01,342 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:17:08,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| .cse0) (fp.lt |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (exists ((|ULTIMATE.start_ARCTAN_~x#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.neg |ULTIMATE.start_ARCTAN_~x#1|))) (and (fp.gt .cse1 .cse2) (= (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse3 (fp.div c_currentRoundingMode .cse2 .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse2 (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 .cse3))) (fp.div c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse4)))))))) |c_ULTIMATE.start_ARCTAN_#t~ret7#1|) (fp.geq |ULTIMATE.start_ARCTAN_~x#1| .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-22 22:17:14,721 WARN L293 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:17:20,157 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:17:27,444 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((|v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| .cse0) (fp.lt |v_ULTIMATE.start_ARCTAN_~x#1_BEFORE_CALL_1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (exists ((|ULTIMATE.start_ARCTAN_~x#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.neg |ULTIMATE.start_ARCTAN_~x#1|))) (and (fp.gt .cse1 .cse2) (= |c_ULTIMATE.start_ARCTAN_#res#1| (fp.neg (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (let ((.cse3 (fp.div c_currentRoundingMode .cse2 .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse2 (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 .cse3))) (fp.div c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) (fp.mul c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 9.0) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) .cse4)))))))))) (fp.geq |ULTIMATE.start_ARCTAN_~x#1| .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-22 22:17:37,828 WARN L293 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:17:43,299 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:17:55,927 WARN L293 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:18:01,394 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:18:14,205 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:18:19,667 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:18:25,089 WARN L293 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:18:30,561 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-22 22:18:33,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1571.0 1000.0)))) (let ((.cse4 (fp.neg .cse5)) (.cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 179000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (.cse6 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1570796326794896619.0 500000000000000000.0)) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse10 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 9.0) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_ARCTAN_~x#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.neg |ULTIMATE.start_ARCTAN_~x#1|))) (let ((.cse3 (fp.neg (fp.sub roundNearestTiesToEven .cse6 (let ((.cse7 (fp.div roundNearestTiesToEven .cse2 .cse1))) (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse8 (fp.mul roundNearestTiesToEven .cse7 .cse7))) (fp.div roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse10 .cse8))))))))))) (and (fp.geq |ULTIMATE.start_ARCTAN_~x#1| .cse0) (fp.gt .cse1 .cse2) (fp.geq .cse3 .cse4) (fp.leq .cse3 .cse5)))))) (and (or (exists ((|ULTIMATE.start_ARCTAN_~x#1| (_ FloatingPoint 11 53))) (let ((.cse11 (fp.neg |ULTIMATE.start_ARCTAN_~x#1|))) (and (fp.geq |ULTIMATE.start_ARCTAN_~x#1| .cse0) (fp.gt .cse11 .cse2) (not (fp.geq (fp.neg (fp.sub roundNearestTiesToEven .cse6 (let ((.cse12 (fp.div roundNearestTiesToEven .cse2 .cse11))) (fp.mul roundNearestTiesToEven .cse12 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse13 (fp.mul roundNearestTiesToEven .cse12 .cse12))) (fp.div roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse10 .cse13))))))))) .cse4))))) (exists ((|ULTIMATE.start_ARCTAN_~x#1| (_ FloatingPoint 11 53))) (let ((.cse14 (fp.neg |ULTIMATE.start_ARCTAN_~x#1|))) (and (fp.geq |ULTIMATE.start_ARCTAN_~x#1| .cse0) (fp.gt .cse14 .cse2) (not (fp.leq (fp.neg (fp.sub roundNearestTiesToEven .cse6 (let ((.cse15 (fp.div roundNearestTiesToEven .cse2 .cse14))) (fp.mul roundNearestTiesToEven .cse15 (fp.sub roundNearestTiesToEven .cse2 (let ((.cse16 (fp.mul roundNearestTiesToEven .cse15 .cse15))) (fp.div roundNearestTiesToEven .cse16 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse10 .cse16))))))))) .cse5)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2023-11-22 22:18:42,029 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15