./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/float-newlib/double_req_bl_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 03:05:16,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 03:05:17,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 03:05:17,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 03:05:17,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 03:05:17,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 03:05:17,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 03:05:17,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 03:05:17,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 03:05:17,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 03:05:17,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 03:05:17,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 03:05:17,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 03:05:17,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 03:05:17,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 03:05:17,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 03:05:17,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 03:05:17,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:05:17,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 03:05:17,083 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2025-03-08 03:05:17,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 03:05:17,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 03:05:17,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 03:05:17,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 03:05:17,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 03:05:17,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-08 03:05:18,416 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7d9744b/48fecc1627e64f59b51afffd55200d99/FLAG31423c551 [2025-03-08 03:05:18,629 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 03:05:18,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-08 03:05:18,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7d9744b/48fecc1627e64f59b51afffd55200d99/FLAG31423c551 [2025-03-08 03:05:18,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7d9744b/48fecc1627e64f59b51afffd55200d99 [2025-03-08 03:05:18,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 03:05:19,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 03:05:19,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 03:05:19,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 03:05:19,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 03:05:19,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:05:18" (1/1) ... [2025-03-08 03:05:19,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693c576e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19, skipping insertion in model container [2025-03-08 03:05:19,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:05:18" (1/1) ... [2025-03-08 03:05:19,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 03:05:19,137 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/float-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-08 03:05:19,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:05:19,145 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 03:05:19,165 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/float-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-08 03:05:19,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:05:19,177 INFO L204 MainTranslator]: Completed translation [2025-03-08 03:05:19,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19 WrapperNode [2025-03-08 03:05:19,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 03:05:19,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 03:05:19,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 03:05:19,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 03:05:19,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,199 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2025-03-08 03:05:19,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 03:05:19,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 03:05:19,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 03:05:19,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 03:05:19,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,214 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 03:05:19,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 03:05:19,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 03:05:19,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 03:05:19,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 03:05:19,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (1/1) ... [2025-03-08 03:05:19,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:05:19,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 03:05:19,248 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) [2025-03-08 03:05:19,250 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 [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-08 03:05:19,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 03:05:19,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 03:05:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 03:05:19,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 03:05:19,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 03:05:19,460 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 03:05:19,460 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 03:05:19,466 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 03:05:19,466 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 03:05:19,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:05:19 BoogieIcfgContainer [2025-03-08 03:05:19,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 03:05:19,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 03:05:19,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 03:05:19,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 03:05:19,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:05:18" (1/3) ... [2025-03-08 03:05:19,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b5b07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:05:19, skipping insertion in model container [2025-03-08 03:05:19,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:19" (2/3) ... [2025-03-08 03:05:19,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b5b07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:05:19, skipping insertion in model container [2025-03-08 03:05:19,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:05:19" (3/3) ... [2025-03-08 03:05:19,474 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2025-03-08 03:05:19,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 03:05:19,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1231b.c that has 2 procedures, 28 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 03:05:19,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 03:05:19,533 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;@1acc8e68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 03:05:19,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 03:05:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:05:19,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 03:05:19,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:19,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:19,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:19,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 30512721, now seen corresponding path program 1 times [2025-03-08 03:05:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 03:05:19,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866769938] [2025-03-08 03:05:19,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 03:05:19,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 03:05:19,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 03:05:19,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:19,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:05:19,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 03:05:19,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 03:05:19,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 03:05:19,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:19,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:05:19,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 03:05:19,654 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 03:05:19,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 2 remaining) [2025-03-08 03:05:19,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 03:05:19,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 03:05:19,661 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 03:05:19,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 03:05:19,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:05:19 BoogieIcfgContainer [2025-03-08 03:05:19,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 03:05:19,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 03:05:19,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 03:05:19,680 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 03:05:19,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:05:19" (3/4) ... [2025-03-08 03:05:19,683 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 03:05:19,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 03:05:19,684 INFO L158 Benchmark]: Toolchain (without parser) took 684.08ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 83.5MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 03:05:19,684 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:05:19,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.09ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:05:19,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.50ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 112.0MB in the end (delta: 702.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:05:19,685 INFO L158 Benchmark]: Boogie Preprocessor took 21.01ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:05:19,686 INFO L158 Benchmark]: IcfgBuilder took 244.81ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 96.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:05:19,686 INFO L158 Benchmark]: TraceAbstraction took 211.10ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 83.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 03:05:19,686 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 167.8MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:05:19,687 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.09ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.50ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 112.0MB in the end (delta: 702.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.01ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 244.81ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 96.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 211.10ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 83.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 167.8MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 23]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 23, overapproximation of someBinaryDOUBLEComparisonOperation at line 18. Possible FailurePath: [L62] double x = __VERIFIER_nondet_double(); [L63] double y = 0.0 / 0.0; [L64] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\result=0] [L64] RET, EXPR isnan_double(x) [L64] COND TRUE !isnan_double(x) [L66] CALL fmin_double(x, y) [L47] CALL __fpclassify_double(x) VAL [\old(x)=54] [L20] __uint32_t msw, lsw; VAL [\old(x)=54] [L23] ieee_double_shape_type ew_u; VAL [\old(x)=54] - UnprovableResult [Line: 70]: 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 2 procedures, 28 locations, 41 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 03:05:19,701 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/21.0.5-tem/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.6.800.v20240513-1750.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/float-newlib/double_req_bl_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 03:05:21,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 03:05:21,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 03:05:21,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 03:05:21,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 03:05:21,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 03:05:21,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 03:05:21,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 03:05:21,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 03:05:21,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 03:05:21,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 03:05:21,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 03:05:21,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 03:05:21,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 03:05:21,640 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 03:05:21,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 03:05:21,641 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 03:05:21,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 03:05:21,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 03:05:21,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 03:05:21,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 03:05:21,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 03:05:21,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 03:05:21,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 03:05:21,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 03:05:21,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:05:21,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 03:05:21,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 03:05:21,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2025-03-08 03:05:21,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 03:05:21,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 03:05:21,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 03:05:21,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 03:05:21,907 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 03:05:21,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-08 03:05:23,051 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fed4e02/fb06af2badf4496993d3ba381abca055/FLAG6f93f9a2f [2025-03-08 03:05:23,222 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 03:05:23,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-08 03:05:23,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fed4e02/fb06af2badf4496993d3ba381abca055/FLAG6f93f9a2f [2025-03-08 03:05:23,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fed4e02/fb06af2badf4496993d3ba381abca055 [2025-03-08 03:05:23,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 03:05:23,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 03:05:23,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 03:05:23,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 03:05:23,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 03:05:23,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff4f779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23, skipping insertion in model container [2025-03-08 03:05:23,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 03:05:23,398 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/float-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-08 03:05:23,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:05:23,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 03:05:23,437 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/float-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-08 03:05:23,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:05:23,450 INFO L204 MainTranslator]: Completed translation [2025-03-08 03:05:23,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23 WrapperNode [2025-03-08 03:05:23,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 03:05:23,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 03:05:23,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 03:05:23,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 03:05:23,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,481 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2025-03-08 03:05:23,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 03:05:23,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 03:05:23,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 03:05:23,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 03:05:23,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,508 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 03:05:23,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 03:05:23,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 03:05:23,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 03:05:23,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 03:05:23,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (1/1) ... [2025-03-08 03:05:23,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:05:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 03:05:23,555 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) [2025-03-08 03:05:23,558 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 [2025-03-08 03:05:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 03:05:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 03:05:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 03:05:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 03:05:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 03:05:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 03:05:23,581 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-08 03:05:23,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-08 03:05:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 03:05:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 03:05:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 03:05:23,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 03:05:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 03:05:23,647 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 03:05:23,649 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 03:05:23,786 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 03:05:23,787 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 03:05:23,792 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 03:05:23,793 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 03:05:23,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:05:23 BoogieIcfgContainer [2025-03-08 03:05:23,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 03:05:23,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 03:05:23,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 03:05:23,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 03:05:23,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:05:23" (1/3) ... [2025-03-08 03:05:23,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a3327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:05:23, skipping insertion in model container [2025-03-08 03:05:23,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:05:23" (2/3) ... [2025-03-08 03:05:23,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a3327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:05:23, skipping insertion in model container [2025-03-08 03:05:23,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:05:23" (3/3) ... [2025-03-08 03:05:23,800 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2025-03-08 03:05:23,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 03:05:23,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1231b.c that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 03:05:23,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 03:05:23,850 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;@3495b56e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 03:05:23,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 03:05:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:05:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 03:05:23,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:23,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:23,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1391657577, now seen corresponding path program 1 times [2025-03-08 03:05:23,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:23,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877199517] [2025-03-08 03:05:23,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:23,875 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 [2025-03-08 03:05:23,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:23,877 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) [2025-03-08 03:05:23,879 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 [2025-03-08 03:05:23,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 03:05:23,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 03:05:23,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:23,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:23,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 03:05:23,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:05:23,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:23,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877199517] [2025-03-08 03:05:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877199517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 03:05:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827702968] [2025-03-08 03:05:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:23,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 03:05:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:24,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 03:05:24,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 03:05:24,005 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:24,018 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2025-03-08 03:05:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 03:05:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 03:05:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:24,022 INFO L225 Difference]: With dead ends: 45 [2025-03-08 03:05:24,023 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 03:05:24,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 03:05:24,026 INFO L435 NwaCegarLoop]: 32 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, 32 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 [2025-03-08 03:05:24,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 03:05:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 03:05:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:05:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-03-08 03:05:24,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2025-03-08 03:05:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:24,052 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-03-08 03:05:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2025-03-08 03:05:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 03:05:24,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:24,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:24,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 03:05:24,254 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 [2025-03-08 03:05:24,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:24,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash 919459099, now seen corresponding path program 1 times [2025-03-08 03:05:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005048167] [2025-03-08 03:05:24,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:24,255 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 [2025-03-08 03:05:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:24,257 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) [2025-03-08 03:05:24,259 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 [2025-03-08 03:05:24,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 03:05:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 03:05:24,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:24,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:24,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:24,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:05:24,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:24,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005048167] [2025-03-08 03:05:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005048167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:24,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5513715] [2025-03-08 03:05:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:24,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:24,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:24,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:24,377 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:24,411 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-03-08 03:05:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 03:05:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:24,413 INFO L225 Difference]: With dead ends: 28 [2025-03-08 03:05:24,413 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 03:05:24,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:24,415 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:24,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 03:05:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 03:05:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 03:05:24,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2025-03-08 03:05:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 03:05:24,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 03:05:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 03:05:24,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:24,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:24,425 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 [2025-03-08 03:05:24,622 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 [2025-03-08 03:05:24,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash -944395987, now seen corresponding path program 1 times [2025-03-08 03:05:24,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:24,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526228312] [2025-03-08 03:05:24,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:24,623 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 [2025-03-08 03:05:24,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:24,626 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) [2025-03-08 03:05:24,628 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 [2025-03-08 03:05:24,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 03:05:24,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 03:05:24,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:24,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:24,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:24,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:05:24,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:24,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:24,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526228312] [2025-03-08 03:05:24,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526228312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999614682] [2025-03-08 03:05:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:24,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:24,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:24,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:24,738 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:24,762 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-03-08 03:05:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-08 03:05:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:24,763 INFO L225 Difference]: With dead ends: 31 [2025-03-08 03:05:24,763 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 03:05:24,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:24,763 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:24,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 03:05:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-08 03:05:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 03:05:24,766 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2025-03-08 03:05:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:24,767 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 03:05:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 03:05:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 03:05:24,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:24,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:24,771 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 (4)] Forceful destruction successful, exit code 0 [2025-03-08 03:05:24,967 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 [2025-03-08 03:05:24,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:24,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1192478498, now seen corresponding path program 1 times [2025-03-08 03:05:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:24,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099027816] [2025-03-08 03:05:24,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:24,969 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 [2025-03-08 03:05:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:24,971 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) [2025-03-08 03:05:24,971 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 [2025-03-08 03:05:24,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 03:05:25,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 03:05:25,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:25,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:25,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:25,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:05:25,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:25,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:25,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099027816] [2025-03-08 03:05:25,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099027816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:25,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:25,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362450070] [2025-03-08 03:05:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:25,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:25,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:25,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:25,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:25,045 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:25,071 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-03-08 03:05:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 03:05:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:25,073 INFO L225 Difference]: With dead ends: 31 [2025-03-08 03:05:25,073 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 03:05:25,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:25,074 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:25,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 03:05:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-08 03:05:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 03:05:25,079 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2025-03-08 03:05:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:25,079 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 03:05:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 03:05:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 03:05:25,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:25,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:25,085 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 (5)] Forceful destruction successful, exit code 0 [2025-03-08 03:05:25,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 [2025-03-08 03:05:25,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:25,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1403748560, now seen corresponding path program 1 times [2025-03-08 03:05:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:25,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795909687] [2025-03-08 03:05:25,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:25,281 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 [2025-03-08 03:05:25,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:25,283 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2025-03-08 03:05:25,284 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 (6)] Waiting until timeout for monitored process [2025-03-08 03:05:25,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 03:05:25,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 03:05:25,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:25,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:25,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:25,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:05:25,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:25,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795909687] [2025-03-08 03:05:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795909687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:25,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:25,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047215617] [2025-03-08 03:05:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:25,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:25,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:25,360 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:25,394 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-03-08 03:05:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:25,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 03:05:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:25,397 INFO L225 Difference]: With dead ends: 31 [2025-03-08 03:05:25,397 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 03:05:25,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:25,398 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:25,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 03:05:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-08 03:05:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 03:05:25,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2025-03-08 03:05:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:25,401 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 03:05:25,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 03:05:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 03:05:25,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:25,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:25,405 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 (6)] Ended with exit code 0 [2025-03-08 03:05:25,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2025-03-08 03:05:25,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2003715055, now seen corresponding path program 1 times [2025-03-08 03:05:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182390925] [2025-03-08 03:05:25,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:25,603 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 [2025-03-08 03:05:25,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:25,605 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2025-03-08 03:05:25,606 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 (7)] Waiting until timeout for monitored process [2025-03-08 03:05:25,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 03:05:25,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 03:05:25,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:25,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 03:05:25,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:05:26,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:26,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182390925] [2025-03-08 03:05:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182390925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:26,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:26,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 03:05:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8022854] [2025-03-08 03:05:26,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:26,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 03:05:26,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:26,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 03:05:26,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 03:05:26,268 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:27,036 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2025-03-08 03:05:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 03:05:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 03:05:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:27,037 INFO L225 Difference]: With dead ends: 41 [2025-03-08 03:05:27,037 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 03:05:27,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-08 03:05:27,039 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:27,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 03:05:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 03:05:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 03:05:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 03:05:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-08 03:05:27,043 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2025-03-08 03:05:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:27,044 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-08 03:05:27,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:05:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-08 03:05:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 03:05:27,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:27,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:27,049 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 (7)] Ended with exit code 0 [2025-03-08 03:05:27,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2025-03-08 03:05:27,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:27,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash 542955741, now seen corresponding path program 1 times [2025-03-08 03:05:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788599837] [2025-03-08 03:05:27,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:27,246 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 [2025-03-08 03:05:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:27,248 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2025-03-08 03:05:27,249 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 (8)] Waiting until timeout for monitored process [2025-03-08 03:05:27,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 03:05:27,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 03:05:27,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:27,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:27,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:27,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 03:05:27,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:27,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788599837] [2025-03-08 03:05:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788599837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477702976] [2025-03-08 03:05:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:27,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:27,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:27,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:27,328 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:27,346 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-08 03:05:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:27,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-08 03:05:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:27,347 INFO L225 Difference]: With dead ends: 30 [2025-03-08 03:05:27,347 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 03:05:27,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:27,348 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:27,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 03:05:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 03:05:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 03:05:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-08 03:05:27,355 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2025-03-08 03:05:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:27,355 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-08 03:05:27,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-08 03:05:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 03:05:27,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:27,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:27,361 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 (8)] Ended with exit code 0 [2025-03-08 03:05:27,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 [2025-03-08 03:05:27,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:27,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash 543015323, now seen corresponding path program 1 times [2025-03-08 03:05:27,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:27,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195557815] [2025-03-08 03:05:27,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:27,562 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 [2025-03-08 03:05:27,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:27,564 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2025-03-08 03:05:27,565 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 (9)] Waiting until timeout for monitored process [2025-03-08 03:05:27,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 03:05:27,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 03:05:27,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:27,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:27,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 03:05:27,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 03:05:27,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:27,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195557815] [2025-03-08 03:05:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195557815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:27,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 03:05:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119567685] [2025-03-08 03:05:27,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:27,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 03:05:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:27,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 03:05:27,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 03:05:27,821 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:27,994 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-08 03:05:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 03:05:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-08 03:05:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:27,996 INFO L225 Difference]: With dead ends: 31 [2025-03-08 03:05:27,996 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 03:05:27,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 03:05:27,997 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:27,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 03:05:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 03:05:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-08 03:05:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-08 03:05:28,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2025-03-08 03:05:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:28,005 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-08 03:05:28,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-08 03:05:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 03:05:28,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:28,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:28,012 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 (9)] Forceful destruction successful, exit code 0 [2025-03-08 03:05:28,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 [2025-03-08 03:05:28,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:28,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 328781713, now seen corresponding path program 1 times [2025-03-08 03:05:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:28,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790925760] [2025-03-08 03:05:28,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:28,207 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 [2025-03-08 03:05:28,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:28,209 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2025-03-08 03:05:28,210 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 (10)] Waiting until timeout for monitored process [2025-03-08 03:05:28,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 03:05:28,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 03:05:28,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:28,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:28,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:28,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 03:05:28,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:28,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:28,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790925760] [2025-03-08 03:05:28,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790925760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:28,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:28,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983933821] [2025-03-08 03:05:28,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:28,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:28,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:28,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:28,286 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:28,313 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-08 03:05:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:28,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-08 03:05:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:28,315 INFO L225 Difference]: With dead ends: 32 [2025-03-08 03:05:28,315 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 03:05:28,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:28,315 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:28,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 03:05:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 03:05:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 03:05:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-08 03:05:28,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2025-03-08 03:05:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:28,319 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-08 03:05:28,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-08 03:05:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 03:05:28,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:28,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:28,324 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 (10)] Forceful destruction successful, exit code 0 [2025-03-08 03:05:28,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 [2025-03-08 03:05:28,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:28,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash 328841295, now seen corresponding path program 1 times [2025-03-08 03:05:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:28,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736926973] [2025-03-08 03:05:28,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:28,521 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 [2025-03-08 03:05:28,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:28,522 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2025-03-08 03:05:28,523 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 (11)] Waiting until timeout for monitored process [2025-03-08 03:05:28,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 03:05:28,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 03:05:28,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:28,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:28,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 03:05:28,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 03:05:28,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:28,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736926973] [2025-03-08 03:05:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736926973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:28,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:28,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 03:05:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538421307] [2025-03-08 03:05:28,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:28,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 03:05:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:28,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 03:05:28,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 03:05:28,764 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:33,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 03:05:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:33,410 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-08 03:05:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 03:05:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-08 03:05:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:33,414 INFO L225 Difference]: With dead ends: 33 [2025-03-08 03:05:33,414 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 03:05:33,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 03:05:33,415 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:33,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 03:05:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 03:05:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-08 03:05:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-08 03:05:33,418 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 24 [2025-03-08 03:05:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-08 03:05:33,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-08 03:05:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 03:05:33,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:33,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:33,423 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 (11)] Ended with exit code 0 [2025-03-08 03:05:33,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 [2025-03-08 03:05:33,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:33,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash -318795552, now seen corresponding path program 1 times [2025-03-08 03:05:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:33,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416810056] [2025-03-08 03:05:33,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:33,620 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 [2025-03-08 03:05:33,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:33,622 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2025-03-08 03:05:33,622 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 (12)] Waiting until timeout for monitored process [2025-03-08 03:05:33,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 03:05:33,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 03:05:33,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:33,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:33,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:33,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 03:05:33,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:33,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416810056] [2025-03-08 03:05:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416810056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:33,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:33,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470889421] [2025-03-08 03:05:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:33,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:33,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:33,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:33,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:33,702 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:33,745 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-08 03:05:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:33,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-08 03:05:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:33,746 INFO L225 Difference]: With dead ends: 32 [2025-03-08 03:05:33,746 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 03:05:33,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:33,747 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:33,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 03:05:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 03:05:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 03:05:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-08 03:05:33,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2025-03-08 03:05:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:33,750 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-08 03:05:33,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-08 03:05:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 03:05:33,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:33,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:33,756 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 (12)] Ended with exit code 0 [2025-03-08 03:05:33,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 [2025-03-08 03:05:33,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -318735970, now seen corresponding path program 1 times [2025-03-08 03:05:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45741804] [2025-03-08 03:05:33,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:33,953 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 [2025-03-08 03:05:33,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:33,954 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2025-03-08 03:05:33,955 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 (13)] Waiting until timeout for monitored process [2025-03-08 03:05:33,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 03:05:34,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 03:05:34,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:34,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:34,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 03:05:34,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 03:05:34,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:34,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:34,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45741804] [2025-03-08 03:05:34,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45741804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:34,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:34,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 03:05:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897372610] [2025-03-08 03:05:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:34,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 03:05:34,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:34,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 03:05:34,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 03:05:34,179 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:34,386 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-03-08 03:05:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 03:05:34,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-08 03:05:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:34,387 INFO L225 Difference]: With dead ends: 35 [2025-03-08 03:05:34,387 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 03:05:34,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 03:05:34,387 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:34,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 03:05:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 03:05:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-03-08 03:05:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-08 03:05:34,391 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 25 [2025-03-08 03:05:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:34,391 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-08 03:05:34,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-08 03:05:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 03:05:34,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:34,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:34,396 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 (13)] Forceful destruction successful, exit code 0 [2025-03-08 03:05:34,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 [2025-03-08 03:05:34,596 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:34,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1516971276, now seen corresponding path program 1 times [2025-03-08 03:05:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997541076] [2025-03-08 03:05:34,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:34,596 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 [2025-03-08 03:05:34,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:34,598 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2025-03-08 03:05:34,600 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 (14)] Waiting until timeout for monitored process [2025-03-08 03:05:34,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 03:05:34,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 03:05:34,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:34,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:34,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:34,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 03:05:34,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:34,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:34,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997541076] [2025-03-08 03:05:34,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997541076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:34,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:34,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181549092] [2025-03-08 03:05:34,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:34,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:34,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:34,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:34,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:34,678 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:34,717 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-08 03:05:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 03:05:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:34,718 INFO L225 Difference]: With dead ends: 30 [2025-03-08 03:05:34,718 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 03:05:34,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:34,718 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:34,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 03:05:34,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 03:05:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:05:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-08 03:05:34,724 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 26 [2025-03-08 03:05:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:34,724 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-08 03:05:34,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-08 03:05:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 03:05:34,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:34,725 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:34,730 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 (14)] Ended with exit code 0 [2025-03-08 03:05:34,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 [2025-03-08 03:05:34,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:34,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1516911694, now seen corresponding path program 1 times [2025-03-08 03:05:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:34,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390212275] [2025-03-08 03:05:34,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:34,926 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 [2025-03-08 03:05:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:34,928 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2025-03-08 03:05:34,930 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 (15)] Waiting until timeout for monitored process [2025-03-08 03:05:34,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 03:05:34,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 03:05:34,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:34,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:35,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 03:05:35,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 03:05:35,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:35,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:35,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390212275] [2025-03-08 03:05:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390212275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 03:05:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354084073] [2025-03-08 03:05:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:35,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 03:05:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:35,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 03:05:35,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 03:05:35,211 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:35,403 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-08 03:05:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 03:05:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 03:05:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:35,404 INFO L225 Difference]: With dead ends: 31 [2025-03-08 03:05:35,404 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 03:05:35,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 03:05:35,405 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:35,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 03:05:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 03:05:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-03-08 03:05:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:05:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 03:05:35,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2025-03-08 03:05:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:35,408 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 03:05:35,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 03:05:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 03:05:35,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:35,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:35,413 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 (15)] Forceful destruction successful, exit code 0 [2025-03-08 03:05:35,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 [2025-03-08 03:05:35,609 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:35,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash -629467595, now seen corresponding path program 1 times [2025-03-08 03:05:35,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:35,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128772312] [2025-03-08 03:05:35,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:35,610 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 [2025-03-08 03:05:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:35,612 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2025-03-08 03:05:35,612 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 (16)] Waiting until timeout for monitored process [2025-03-08 03:05:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 03:05:35,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 03:05:35,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:35,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:35,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 03:05:35,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 03:05:35,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 03:05:36,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128772312] [2025-03-08 03:05:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128772312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 03:05:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776370548] [2025-03-08 03:05:36,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:36,531 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 03:05:36,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 03:05:36,555 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 03:05:36,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-08 03:05:36,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 03:05:36,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 03:05:36,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:36,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:36,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 03:05:36,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 03:05:36,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [776370548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:36,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 03:05:36,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-03-08 03:05:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509706874] [2025-03-08 03:05:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:36,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 03:05:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:36,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 03:05:36,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-08 03:05:36,965 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:37,026 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-08 03:05:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 03:05:37,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 03:05:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:37,027 INFO L225 Difference]: With dead ends: 27 [2025-03-08 03:05:37,027 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 03:05:37,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-08 03:05:37,028 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:37,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 03:05:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 03:05:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 03:05:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:05:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-08 03:05:37,032 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 26 [2025-03-08 03:05:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:37,033 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-08 03:05:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-08 03:05:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 03:05:37,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:05:37,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:37,041 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 (16)] Ended with exit code 0 [2025-03-08 03:05:37,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-08 03:05:37,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 03:05:37,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:05:37,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:05:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash -629408013, now seen corresponding path program 1 times [2025-03-08 03:05:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:05:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287836582] [2025-03-08 03:05:37,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:05:37,435 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 [2025-03-08 03:05:37,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:05:37,436 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2025-03-08 03:05:37,437 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 (18)] Waiting until timeout for monitored process [2025-03-08 03:05:37,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 03:05:37,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 03:05:37,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:05:37,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:05:37,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:05:37,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:05:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 03:05:37,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:05:37,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:05:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287836582] [2025-03-08 03:05:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287836582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:05:37,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:05:37,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:05:37,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771068938] [2025-03-08 03:05:37,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:05:37,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:05:37,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:05:37,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:05:37,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:37,514 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:05:37,528 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-03-08 03:05:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:05:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 03:05:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:05:37,528 INFO L225 Difference]: With dead ends: 23 [2025-03-08 03:05:37,528 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 03:05:37,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:05:37,530 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:05:37,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:05:37,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 03:05:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 03:05:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-03-08 03:05:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 03:05:37,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-03-08 03:05:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:05:37,530 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 03:05:37,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:05:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 03:05:37,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 03:05:37,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 03:05:37,537 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 (18)] Ended with exit code 0 [2025-03-08 03:05:37,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2025-03-08 03:05:37,736 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:05:37,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 03:05:38,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 03:05:38,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:05:38 BoogieIcfgContainer [2025-03-08 03:05:38,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 03:05:38,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 03:05:38,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 03:05:38,650 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 03:05:38,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:05:23" (3/4) ... [2025-03-08 03:05:38,652 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 03:05:38,655 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2025-03-08 03:05:38,659 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 03:05:38,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-08 03:05:38,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 03:05:38,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 03:05:38,679 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-08 03:05:38,689 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-08 03:05:38,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 03:05:38,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 03:05:38,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 03:05:38,717 INFO L158 Benchmark]: Toolchain (without parser) took 15466.05ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 48.6MB in the end (delta: 43.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-03-08 03:05:38,717 INFO L158 Benchmark]: CDTParser took 2.21ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:05:38,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.25ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:05:38,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.06ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:05:38,718 INFO L158 Benchmark]: Boogie Preprocessor took 45.84ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:05:38,719 INFO L158 Benchmark]: IcfgBuilder took 264.05ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 63.1MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:05:38,719 INFO L158 Benchmark]: TraceAbstraction took 14854.25ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 53.7MB in the end (delta: 8.9MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2025-03-08 03:05:38,719 INFO L158 Benchmark]: Witness Printer took 67.02ms. Allocated memory is still 117.4MB. Free memory was 53.7MB in the beginning and 48.6MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:05:38,720 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.21ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.25ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.06ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.84ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.05ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 63.1MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14854.25ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 53.7MB in the end (delta: 8.9MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * Witness Printer took 67.02ms. Allocated memory is still 117.4MB. Free memory was 53.7MB in the beginning and 48.6MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 70]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 37 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 1103 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 740 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 530 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 363 mSDtfsCounter, 530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=9, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 355 ConstructedInterpolants, 58 QuantifiedInterpolants, 1789 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1293 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 61/66 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: (\old(x) == x) RESULT: Ultimate proved your program to be correct! [2025-03-08 03:05:38,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE