./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.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 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:04:52,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:04:52,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 10:04:52,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:04:52,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:04:52,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:04:52,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:04:52,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:04:52,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:04:52,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:04:52,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:04:52,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:04:52,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:04:52,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:04:52,981 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:04:52,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:04:52,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:04:52,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 10:04:52,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:04:52,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 10:04:52,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:04:52,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:04:52,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:04:52,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:04:52,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:04:52,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 10:04:52,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:04:52,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:04:52,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:04:52,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:04:52,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:04:52,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:04:52,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:04:52,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:04:52,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:04:52,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:04:52,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:04:52,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:04:52,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:04:52,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:04:52,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:04:52,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:04:52,992 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 -> 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 [2024-11-16 10:04:53,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:04:53,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:04:53,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:04:53,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:04:53,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:04:53,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2024-11-16 10:04:54,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:04:54,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:04:54,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2024-11-16 10:04:54,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb0c087c/045568cc8dae4a2b8554f758bb973a54/FLAG2b3e3b98b [2024-11-16 10:04:54,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb0c087c/045568cc8dae4a2b8554f758bb973a54 [2024-11-16 10:04:54,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:04:54,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:04:54,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:04:54,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:04:54,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:04:54,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3f46db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54, skipping insertion in model container [2024-11-16 10:04:54,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:04:54,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2024-11-16 10:04:54,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2024-11-16 10:04:54,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:04:54,742 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:04:54,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2024-11-16 10:04:54,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2024-11-16 10:04:54,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:04:54,786 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:04:54,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54 WrapperNode [2024-11-16 10:04:54,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:04:54,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:04:54,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:04:54,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:04:54,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,819 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 210 [2024-11-16 10:04:54,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:04:54,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:04:54,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:04:54,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:04:54,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,851 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:04:54,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:04:54,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:04:54,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:04:54,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:04:54,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (1/1) ... [2024-11-16 10:04:54,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:04:54,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:04:54,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:04:54,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:04:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:04:54,935 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-16 10:04:54,936 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-16 10:04:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:04:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:04:54,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:04:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 10:04:54,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 10:04:55,011 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:04:55,013 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:04:55,373 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-16 10:04:55,373 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:04:55,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:04:55,404 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 10:04:55,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:04:55 BoogieIcfgContainer [2024-11-16 10:04:55,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:04:55,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:04:55,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:04:55,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:04:55,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:04:54" (1/3) ... [2024-11-16 10:04:55,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca4a92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:04:55, skipping insertion in model container [2024-11-16 10:04:55,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:54" (2/3) ... [2024-11-16 10:04:55,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca4a92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:04:55, skipping insertion in model container [2024-11-16 10:04:55,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:04:55" (3/3) ... [2024-11-16 10:04:55,413 INFO L112 eAbstractionObserver]: Analyzing ICFG square_8+soft_float_1-3a.c.cil.c [2024-11-16 10:04:55,425 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:04:55,426 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 10:04:55,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:04:55,481 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@504575d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:04:55,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 10:04:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 100 states have (on average 1.52) internal successors, (152), 104 states have internal predecessors, (152), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 10:04:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-16 10:04:55,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:04:55,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:04:55,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:04:55,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:04:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash -827483621, now seen corresponding path program 1 times [2024-11-16 10:04:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:04:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569518264] [2024-11-16 10:04:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:04:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:04:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:04:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:04:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:04:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569518264] [2024-11-16 10:04:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569518264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:04:55,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:04:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 10:04:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787328766] [2024-11-16 10:04:55,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:04:55,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 10:04:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:04:55,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 10:04:55,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 10:04:55,641 INFO L87 Difference]: Start difference. First operand has 114 states, 100 states have (on average 1.52) internal successors, (152), 104 states have internal predecessors, (152), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:04:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:04:55,684 INFO L93 Difference]: Finished difference Result 222 states and 340 transitions. [2024-11-16 10:04:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 10:04:55,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-16 10:04:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:04:55,693 INFO L225 Difference]: With dead ends: 222 [2024-11-16 10:04:55,695 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 10:04:55,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 10:04:55,702 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:04:55,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:04:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 10:04:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-16 10:04:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 96 states have internal predecessors, (134), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 10:04:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-11-16 10:04:55,757 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 7 [2024-11-16 10:04:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:04:55,757 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-11-16 10:04:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:04:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-11-16 10:04:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-16 10:04:55,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:04:55,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:04:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:04:55,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:04:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:04:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash -827453830, now seen corresponding path program 1 times [2024-11-16 10:04:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:04:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821707317] [2024-11-16 10:04:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:04:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:04:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:04:55,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:04:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:04:55,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 10:04:55,835 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:04:55,837 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 10:04:55,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 10:04:55,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:04:55,841 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 10:04:55,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:04:55,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:04:55 BoogieIcfgContainer [2024-11-16 10:04:55,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:04:55,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:04:55,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:04:55,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:04:55,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:04:55" (3/4) ... [2024-11-16 10:04:55,856 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 10:04:55,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:04:55,857 INFO L158 Benchmark]: Toolchain (without parser) took 1326.61ms. Allocated memory is still 174.1MB. Free memory was 144.2MB in the beginning and 134.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 10:04:55,857 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:04:55,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.12ms. Allocated memory is still 174.1MB. Free memory was 143.1MB in the beginning and 126.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 10:04:55,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.43ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:04:55,858 INFO L158 Benchmark]: Boogie Preprocessor took 42.67ms. Allocated memory is still 174.1MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:04:55,859 INFO L158 Benchmark]: IcfgBuilder took 541.26ms. Allocated memory is still 174.1MB. Free memory was 122.2MB in the beginning and 94.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 10:04:55,859 INFO L158 Benchmark]: TraceAbstraction took 446.82ms. Allocated memory is still 174.1MB. Free memory was 94.9MB in the beginning and 135.8MB in the end (delta: -40.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:04:55,860 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 174.1MB. Free memory was 135.8MB in the beginning and 134.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:04:55,862 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 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.12ms. Allocated memory is still 174.1MB. Free memory was 143.1MB in the beginning and 126.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.43ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.67ms. Allocated memory is still 174.1MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 541.26ms. Allocated memory is still 174.1MB. Free memory was 122.2MB in the beginning and 94.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 446.82ms. Allocated memory is still 174.1MB. Free memory was 94.9MB in the beginning and 135.8MB in the end (delta: -40.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 174.1MB. Free memory was 135.8MB in the beginning and 134.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 48]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L402] COND TRUE __VERIFIER_nondet_int() [L403] CALL main1() [L39] float IN = __VERIFIER_nondet_float(); [L40] CALL assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L34] COND FALSE !(!cond) [L40] RET assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L42] float x = IN; [L44-L45] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; [L47] COND TRUE !(result >= 0.0f && result < 1.5f) [L48] reach_error() - UnprovableResult [Line: 60]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 153 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred 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, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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 [2024-11-16 10:04:55,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.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 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:04:57,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:04:57,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 10:04:57,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:04:57,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:04:57,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:04:57,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:04:57,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:04:57,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:04:57,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:04:57,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:04:57,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:04:57,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:04:57,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:04:57,747 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:04:57,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:04:57,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:04:57,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 10:04:57,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 10:04:57,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:04:57,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:04:57,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:04:57,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:04:57,750 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 10:04:57,751 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 10:04:57,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:04:57,752 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 10:04:57,752 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 10:04:57,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:04:57,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:04:57,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:04:57,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:04:57,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:04:57,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:04:57,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:04:57,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:04:57,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:04:57,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:04:57,755 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 10:04:57,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 10:04:57,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:04:57,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:04:57,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:04:57,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:04:57,756 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 -> 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 [2024-11-16 10:04:57,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:04:58,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:04:58,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:04:58,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:04:58,012 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:04:58,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2024-11-16 10:04:59,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:04:59,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:04:59,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2024-11-16 10:04:59,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14e7d655/8ab7067b895e4db588af23938119f9f2/FLAG9dc3520c3 [2024-11-16 10:04:59,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14e7d655/8ab7067b895e4db588af23938119f9f2 [2024-11-16 10:04:59,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:04:59,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:04:59,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:04:59,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:04:59,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:04:59,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:04:59" (1/1) ... [2024-11-16 10:04:59,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574cbd25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:04:59, skipping insertion in model container [2024-11-16 10:04:59,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:04:59" (1/1) ... [2024-11-16 10:04:59,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:04:59,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2024-11-16 10:04:59,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2024-11-16 10:05:00,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:05:00,052 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:05:00,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2024-11-16 10:05:00,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2024-11-16 10:05:00,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:05:00,123 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:05:00,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00 WrapperNode [2024-11-16 10:05:00,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:05:00,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:05:00,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:05:00,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:05:00,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,166 INFO L138 Inliner]: procedures = 28, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 167 [2024-11-16 10:05:00,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:05:00,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:05:00,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:05:00,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:05:00,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,197 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:05:00,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:05:00,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:05:00,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:05:00,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:05:00,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (1/1) ... [2024-11-16 10:05:00,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:05:00,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:05:00,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:05:00,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:05:00,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:05:00,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 10:05:00,272 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-16 10:05:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-16 10:05:00,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:05:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:05:00,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 10:05:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 10:05:00,336 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:05:00,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:05:05,166 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-16 10:05:05,166 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:05:05,180 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:05:05,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:05:05,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:05:05 BoogieIcfgContainer [2024-11-16 10:05:05,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:05:05,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:05:05,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:05:05,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:05:05,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:04:59" (1/3) ... [2024-11-16 10:05:05,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37987917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:05:05, skipping insertion in model container [2024-11-16 10:05:05,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:05:00" (2/3) ... [2024-11-16 10:05:05,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37987917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:05:05, skipping insertion in model container [2024-11-16 10:05:05,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:05:05" (3/3) ... [2024-11-16 10:05:05,189 INFO L112 eAbstractionObserver]: Analyzing ICFG square_8+soft_float_1-3a.c.cil.c [2024-11-16 10:05:05,201 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:05:05,201 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 10:05:05,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:05:05,250 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@6e4b19a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:05:05,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 10:05:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 76 states have (on average 1.513157894736842) internal successors, (115), 80 states have internal predecessors, (115), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 10:05:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-16 10:05:05,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:05:05,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:05:05,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:05:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:05:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1799938766, now seen corresponding path program 1 times [2024-11-16 10:05:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:05:05,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978138539] [2024-11-16 10:05:05,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:05:05,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:05:05,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:05:05,273 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) [2024-11-16 10:05:05,274 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 [2024-11-16 10:05:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:05:05,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 10:05:05,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:05:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:05:05,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:05:05,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:05:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978138539] [2024-11-16 10:05:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978138539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:05:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:05:05,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 10:05:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762062729] [2024-11-16 10:05:05,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:05:05,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 10:05:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:05:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 10:05:05,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 10:05:05,653 INFO L87 Difference]: Start difference. First operand has 90 states, 76 states have (on average 1.513157894736842) internal successors, (115), 80 states have internal predecessors, (115), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:05:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:05:05,681 INFO L93 Difference]: Finished difference Result 174 states and 266 transitions. [2024-11-16 10:05:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 10:05:05,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-16 10:05:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:05:05,690 INFO L225 Difference]: With dead ends: 174 [2024-11-16 10:05:05,690 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 10:05:05,694 INFO L431 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 [2024-11-16 10:05:05,698 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:05:05,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:05:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 10:05:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-16 10:05:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.434782608695652) internal successors, (99), 72 states have internal predecessors, (99), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 10:05:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-11-16 10:05:05,737 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 7 [2024-11-16 10:05:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:05:05,738 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-11-16 10:05:05,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:05:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-11-16 10:05:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-16 10:05:05,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:05:05,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:05:05,753 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-16 10:05:05,940 WARN L453 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 [2024-11-16 10:05:05,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:05:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:05:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1799968557, now seen corresponding path program 1 times [2024-11-16 10:05:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:05:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790539440] [2024-11-16 10:05:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:05:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:05:05,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:05:05,944 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) [2024-11-16 10:05:05,945 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 [2024-11-16 10:05:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:05:10,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 10:05:10,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:05:19,638 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:05:29,978 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:05:34,060 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main1_~IN~0#1_5| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.geq |v_ULTIMATE.start_main1_~IN~0#1_5| (_ +zero 8 24)) (fp.lt |v_ULTIMATE.start_main1_~IN~0#1_5| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) |c_ULTIMATE.start_main1_~result~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-16 10:05:50,425 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:05:55,992 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:06:04,114 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:06:16,405 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:06:21,563 WARN L286 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:06:29,689 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 10:06:33,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)))) (or (exists ((|v_ULTIMATE.start_main1_~IN~0#1_5| (_ FloatingPoint 8 24))) (and (fp.geq |v_ULTIMATE.start_main1_~IN~0#1_5| (_ +zero 8 24)) (fp.lt |v_ULTIMATE.start_main1_~IN~0#1_5| .cse0) (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))))) (exists ((|v_ULTIMATE.start_main1_~IN~0#1_5| (_ FloatingPoint 8 24))) (and (fp.geq |v_ULTIMATE.start_main1_~IN~0#1_5| (_ +zero 8 24)) (fp.lt |v_ULTIMATE.start_main1_~IN~0#1_5| .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (_ +zero 8 24))))))) is different from false [2024-11-16 10:06:37,871 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)))) (or (exists ((|v_ULTIMATE.start_main1_~IN~0#1_5| (_ FloatingPoint 8 24))) (and (fp.geq |v_ULTIMATE.start_main1_~IN~0#1_5| (_ +zero 8 24)) (fp.lt |v_ULTIMATE.start_main1_~IN~0#1_5| .cse0) (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))))) (exists ((|v_ULTIMATE.start_main1_~IN~0#1_5| (_ FloatingPoint 8 24))) (and (fp.geq |v_ULTIMATE.start_main1_~IN~0#1_5| (_ +zero 8 24)) (fp.lt |v_ULTIMATE.start_main1_~IN~0#1_5| .cse0) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|) |v_ULTIMATE.start_main1_~IN~0#1_5|)) (_ +zero 8 24))))))) is different from true [2024-11-16 10:06:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:06:37,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:06:37,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:06:37,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790539440] [2024-11-16 10:06:37,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790539440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:06:37,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:06:37,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:06:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247013928] [2024-11-16 10:06:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:06:37,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:06:37,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:06:37,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:06:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2024-11-16 10:06:37,878 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:06:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:06:39,790 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2024-11-16 10:06:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:06:39,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-16 10:06:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:06:39,792 INFO L225 Difference]: With dead ends: 82 [2024-11-16 10:06:39,792 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 10:06:39,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2024-11-16 10:06:39,793 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 110 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 10:06:39,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 297 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 232 Unchecked, 1.9s Time] [2024-11-16 10:06:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 10:06:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 10:06:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 67 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 10:06:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2024-11-16 10:06:39,803 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 7 [2024-11-16 10:06:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:06:39,804 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2024-11-16 10:06:39,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:06:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2024-11-16 10:06:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 10:06:39,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:06:39,805 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:06:39,821 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 (3)] Ended with exit code 0 [2024-11-16 10:06:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 [2024-11-16 10:06:40,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:06:40,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:06:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 73006269, now seen corresponding path program 1 times [2024-11-16 10:06:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:06:40,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802340630] [2024-11-16 10:06:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:06:40,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:06:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:06:40,014 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2024-11-16 10:06:40,016 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 (4)] Waiting until timeout for monitored process [2024-11-16 10:06:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:06:40,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 10:06:40,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:06:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 10:06:40,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:06:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 10:06:41,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:06:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802340630] [2024-11-16 10:06:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802340630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:06:41,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:06:41,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-16 10:06:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007183423] [2024-11-16 10:06:41,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:06:41,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:06:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:06:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:06:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:06:41,355 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 10:06:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:06:42,084 INFO L93 Difference]: Finished difference Result 136 states and 204 transitions. [2024-11-16 10:06:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:06:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-16 10:06:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:06:42,090 INFO L225 Difference]: With dead ends: 136 [2024-11-16 10:06:42,090 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 10:06:42,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:06:42,092 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 5 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:06:42,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 542 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:06:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 10:06:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-16 10:06:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 76 states have internal predecessors, (104), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-16 10:06:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2024-11-16 10:06:42,101 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 34 [2024-11-16 10:06:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:06:42,101 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2024-11-16 10:06:42,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 10:06:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2024-11-16 10:06:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 10:06:42,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:06:42,103 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:06:42,108 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 (4)] Ended with exit code 0 [2024-11-16 10:06:42,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 [2024-11-16 10:06:42,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:06:42,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:06:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash 74116797, now seen corresponding path program 1 times [2024-11-16 10:06:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:06:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892027069] [2024-11-16 10:06:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:06:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:06:42,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:06:42,311 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2024-11-16 10:06:42,312 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 (5)] Waiting until timeout for monitored process [2024-11-16 10:06:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:06:42,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 10:06:42,349 INFO L278 TraceCheckSpWp]: Computing forward predicates...