./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1232b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_1232b.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 e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:55:15,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:55:15,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:55:15,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:55:15,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:55:15,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:55:15,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:55:15,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:55:15,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:55:15,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:55:15,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:55:15,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:55:15,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:55:15,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:55:15,788 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:55:15,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:55:15,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:55:15,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:55:15,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:55:15,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:55:15,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:55:15,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:55:15,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:55:15,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:55:15,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:15,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:55:15,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:55:15,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:55:15,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:55:15,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:55:15,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:55:15,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:55:15,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:55:15,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:55:15,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:55:15,791 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 -> e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 [2025-03-03 11:55:16,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:55:16,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:55:16,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:55:16,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:55:16,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:55:16,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-03 11:55:17,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932fdf0e/3ec400727e4d4b96afcc35423cd022d1/FLAG5d4671b6b [2025-03-03 11:55:17,362 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:55:17,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-03 11:55:17,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932fdf0e/3ec400727e4d4b96afcc35423cd022d1/FLAG5d4671b6b [2025-03-03 11:55:17,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3932fdf0e/3ec400727e4d4b96afcc35423cd022d1 [2025-03-03 11:55:17,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:55:17,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:55:17,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:17,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:55:17,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:55:17,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237de6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17, skipping insertion in model container [2025-03-03 11:55:17,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:55:17,531 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_1232b.c[1958,1971] [2025-03-03 11:55:17,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:17,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:55:17,562 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_1232b.c[1958,1971] [2025-03-03 11:55:17,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:17,573 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:55:17,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17 WrapperNode [2025-03-03 11:55:17,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:17,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:17,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:55:17,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:55:17,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,598 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-03-03 11:55:17,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:17,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:55:17,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:55:17,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:55:17,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,616 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-03 11:55:17,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:55:17,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:55:17,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:55:17,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:55:17,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (1/1) ... [2025-03-03 11:55:17,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:55:17,649 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-03 11:55:17,650 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-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-03 11:55:17,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-03 11:55:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-03 11:55:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-03 11:55:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:55:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:55:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 11:55:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 11:55:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 11:55:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:55:17,727 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:55:17,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:55:17,892 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 11:55:17,893 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:55:17,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:55:17,903 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:55:17,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:17 BoogieIcfgContainer [2025-03-03 11:55:17,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:55:17,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:55:17,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:55:17,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:55:17,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:55:17" (1/3) ... [2025-03-03 11:55:17,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c82e171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:17, skipping insertion in model container [2025-03-03 11:55:17,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:17" (2/3) ... [2025-03-03 11:55:17,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c82e171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:17, skipping insertion in model container [2025-03-03 11:55:17,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:17" (3/3) ... [2025-03-03 11:55:17,911 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2025-03-03 11:55:17,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:55:17,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1232b.c that has 2 procedures, 31 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-03 11:55:17,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:55:17,966 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;@6f7677e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:55:17,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-03 11:55:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 27 states have internal predecessors, (41), 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-03 11:55:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 11:55:17,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:17,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 11:55:17,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-03 11:55:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash 77271573, now seen corresponding path program 1 times [2025-03-03 11:55:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:55:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765134214] [2025-03-03 11:55:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:55:18,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 11:55:18,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 11:55:18,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:18,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:55:18,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:55:18,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 11:55:18,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 11:55:18,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:18,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:55:18,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 11:55:18,060 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:55:18,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 3 remaining) [2025-03-03 11:55:18,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-03 11:55:18,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 3 remaining) [2025-03-03 11:55:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:55:18,065 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-03 11:55:18,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:55:18,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:55:18 BoogieIcfgContainer [2025-03-03 11:55:18,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:55:18,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:55:18,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:55:18,080 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:55:18,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:17" (3/4) ... [2025-03-03 11:55:18,082 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 11:55:18,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:55:18,084 INFO L158 Benchmark]: Toolchain (without parser) took 694.80ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 81.1MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 11:55:18,084 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:18,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.43ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:18,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.17ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:18,084 INFO L158 Benchmark]: Boogie Preprocessor took 24.23ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:18,085 INFO L158 Benchmark]: IcfgBuilder took 279.15ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 94.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:18,085 INFO L158 Benchmark]: TraceAbstraction took 174.83ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 81.5MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 11:55:18,085 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 167.8MB. Free memory was 81.5MB in the beginning and 81.1MB in the end (delta: 415.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:18,086 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.43ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 110.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.17ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.23ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 279.15ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 94.1MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 174.83ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 81.5MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 167.8MB. Free memory was 81.5MB in the beginning and 81.1MB in the end (delta: 415.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 24]: 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 union with floats in the HoenickeLindenmann_Original memory model at line 24, overapproximation of someUnaryDOUBLEoperation at line 76. Possible FailurePath: [L76] double x = -0.0; [L77] double y = 0.0; [L78] CALL fmin_double(x, y) [L48] CALL __fpclassify_double(x) VAL [\old(x)=54] [L21] __uint32_t msw, lsw; VAL [\old(x)=54] [L24] ieee_double_shape_type ew_u; VAL [\old(x)=54] - UnprovableResult [Line: 82]: 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. - UnprovableResult [Line: 60]: 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: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, 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=31occurred 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, 5 NumberOfCodeBlocks, 5 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-03 11:55:18,098 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_1232b.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 e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:55:19,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:55:20,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 11:55:20,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:55:20,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:55:20,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:55:20,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:55:20,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:55:20,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:55:20,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:55:20,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:55:20,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:55:20,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:55:20,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:55:20,089 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:55:20,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 11:55:20,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:55:20,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:55:20,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:20,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:55:20,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:55:20,092 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 -> e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 [2025-03-03 11:55:20,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:55:20,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:55:20,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:55:20,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:55:20,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:55:20,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-03 11:55:21,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5927a0d/c6e5ab73333b46a2a8fc9dfa173732f6/FLAG9ac0a1a10 [2025-03-03 11:55:21,732 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:55:21,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-03 11:55:21,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5927a0d/c6e5ab73333b46a2a8fc9dfa173732f6/FLAG9ac0a1a10 [2025-03-03 11:55:22,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5927a0d/c6e5ab73333b46a2a8fc9dfa173732f6 [2025-03-03 11:55:22,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:55:22,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:55:22,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:22,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:55:22,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:55:22,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797546de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22, skipping insertion in model container [2025-03-03 11:55:22,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:55:22,261 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_1232b.c[1958,1971] [2025-03-03 11:55:22,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:22,277 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:55:22,301 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_1232b.c[1958,1971] [2025-03-03 11:55:22,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:22,323 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:55:22,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22 WrapperNode [2025-03-03 11:55:22,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:22,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:22,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:55:22,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:55:22,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,360 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-03-03 11:55:22,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:22,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:55:22,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:55:22,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:55:22,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,389 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-03 11:55:22,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:55:22,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:55:22,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:55:22,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:55:22,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (1/1) ... [2025-03-03 11:55:22,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:55:22,445 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-03 11:55:22,449 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-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-03 11:55:22,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-03 11:55:22,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:55:22,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:55:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:55:22,533 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:55:22,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:55:22,729 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 11:55:22,730 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:55:22,739 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:55:22,739 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:55:22,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:22 BoogieIcfgContainer [2025-03-03 11:55:22,740 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:55:22,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:55:22,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:55:22,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:55:22,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:55:22" (1/3) ... [2025-03-03 11:55:22,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0e6d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:22, skipping insertion in model container [2025-03-03 11:55:22,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:22" (2/3) ... [2025-03-03 11:55:22,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0e6d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:22, skipping insertion in model container [2025-03-03 11:55:22,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:22" (3/3) ... [2025-03-03 11:55:22,747 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2025-03-03 11:55:22,757 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:55:22,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1232b.c that has 2 procedures, 27 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 11:55:22,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:55:22,800 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;@73519fc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:55:22,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:55:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 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-03 11:55:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:55:22,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:22,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:22,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2062203858, now seen corresponding path program 1 times [2025-03-03 11:55:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022971332] [2025-03-03 11:55:22,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:22,823 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-03 11:55:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:22,825 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-03 11:55:22,826 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-03 11:55:22,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:55:22,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:55:22,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:22,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:22,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 11:55:22,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:22,911 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-03 11:55:22,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:22,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:22,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022971332] [2025-03-03 11:55:22,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022971332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:22,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:22,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:55:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905729363] [2025-03-03 11:55:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:22,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 11:55:22,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:22,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 11:55:22,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:55:22,931 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03 11:55:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:22,942 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2025-03-03 11:55:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 11:55:22,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2025-03-03 11:55:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:22,947 INFO L225 Difference]: With dead ends: 51 [2025-03-03 11:55:22,947 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 11:55:22,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-03 11:55:22,951 INFO L435 NwaCegarLoop]: 34 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, 34 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-03 11:55:22,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 11:55:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 11:55:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-03 11:55:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 11:55:22,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2025-03-03 11:55:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:22,974 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 11:55:22,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03 11:55:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 11:55:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 11:55:22,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:22,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:22,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 11:55:23,180 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-03 11:55:23,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:23,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1219521436, now seen corresponding path program 1 times [2025-03-03 11:55:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439090646] [2025-03-03 11:55:23,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:23,182 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-03 11:55:23,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:23,185 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-03 11:55:23,186 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-03 11:55:23,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 11:55:23,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 11:55:23,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:23,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:23,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:23,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:23,275 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-03 11:55:23,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:23,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439090646] [2025-03-03 11:55:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439090646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:23,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387517057] [2025-03-03 11:55:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:23,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:23,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:23,277 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-03 11:55:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:23,300 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-03-03 11:55:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:23,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-03 11:55:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:23,302 INFO L225 Difference]: With dead ends: 36 [2025-03-03 11:55:23,302 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 11:55:23,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-03 11:55:23,303 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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-03 11:55:23,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 11:55:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 11:55:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-03 11:55:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-03 11:55:23,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2025-03-03 11:55:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:23,308 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-03 11:55:23,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-03 11:55:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-03 11:55:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 11:55:23,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:23,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:23,312 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-03 11:55:23,509 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-03 11:55:23,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:23,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1732408590, now seen corresponding path program 1 times [2025-03-03 11:55:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221410857] [2025-03-03 11:55:23,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:23,511 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-03 11:55:23,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:23,512 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-03 11:55:23,514 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-03 11:55:23,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 11:55:23,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 11:55:23,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:23,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:23,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 11:55:23,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:23,768 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-03 11:55:23,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:23,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:23,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221410857] [2025-03-03 11:55:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221410857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:23,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:23,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:55:23,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401129572] [2025-03-03 11:55:23,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:23,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:55:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:23,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:55:23,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:55:23,770 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-03 11:55:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:24,240 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2025-03-03 11:55:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 11:55:24,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-03 11:55:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:24,241 INFO L225 Difference]: With dead ends: 53 [2025-03-03 11:55:24,241 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 11:55:24,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:55:24,242 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:24,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:55:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 11:55:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-03 11:55:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-03 11:55:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-03-03 11:55:24,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2025-03-03 11:55:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:24,246 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-03 11:55:24,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-03 11:55:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-03-03 11:55:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 11:55:24,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:24,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:24,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 11:55:24,447 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-03 11:55:24,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1514793145, now seen corresponding path program 1 times [2025-03-03 11:55:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141137859] [2025-03-03 11:55:24,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:24,449 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-03 11:55:24,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:24,450 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-03 11:55:24,451 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-03 11:55:24,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:55:24,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:55:24,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:24,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:24,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:24,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:24,509 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-03 11:55:24,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:24,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141137859] [2025-03-03 11:55:24,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141137859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:24,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:24,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168665763] [2025-03-03 11:55:24,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:24,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:24,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:24,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:24,511 INFO L87 Difference]: Start difference. First operand 29 states and 37 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-03 11:55:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:24,531 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2025-03-03 11:55:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:24,533 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-03 11:55:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:24,533 INFO L225 Difference]: With dead ends: 41 [2025-03-03 11:55:24,534 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 11:55:24,534 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-03 11:55:24,535 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 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-03 11:55:24,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 11:55:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-03 11:55:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-03 11:55:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-03-03 11:55:24,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2025-03-03 11:55:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:24,540 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-03 11:55:24,540 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-03 11:55:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-03-03 11:55:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 11:55:24,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:24,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:24,544 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 (5)] Ended with exit code 0 [2025-03-03 11:55:24,744 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-03 11:55:24,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:24,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 126433611, now seen corresponding path program 1 times [2025-03-03 11:55:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868387797] [2025-03-03 11:55:24,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:24,745 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-03 11:55:24,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:24,747 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-03 11:55:24,748 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-03 11:55:24,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 11:55:24,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 11:55:24,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:24,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:24,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 11:55:24,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:24,938 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-03 11:55:24,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:24,939 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868387797] [2025-03-03 11:55:24,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868387797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:24,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:24,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:55:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455358693] [2025-03-03 11:55:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:24,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:55:24,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:24,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:55:24,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:55:24,940 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03 11:55:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:25,143 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-03 11:55:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:55:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03 11:55:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:25,144 INFO L225 Difference]: With dead ends: 53 [2025-03-03 11:55:25,144 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 11:55:25,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:55:25,145 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:25,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:55:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 11:55:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-03 11:55:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-03 11:55:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-03 11:55:25,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2025-03-03 11:55:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:25,149 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-03 11:55:25,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03 11:55:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-03 11:55:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 11:55:25,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:25,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:25,153 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-03 11:55:25,350 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-03 11:55:25,350 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:25,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1881886182, now seen corresponding path program 1 times [2025-03-03 11:55:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:25,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833974745] [2025-03-03 11:55:25,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:25,351 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-03 11:55:25,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:25,353 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-03 11:55:25,354 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-03 11:55:25,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 11:55:25,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 11:55:25,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:25,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:25,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:25,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:25,415 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-03 11:55:25,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:25,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833974745] [2025-03-03 11:55:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833974745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:25,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:25,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058422712] [2025-03-03 11:55:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:25,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:25,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:25,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:25,416 INFO L87 Difference]: Start difference. First operand 26 states and 32 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, (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-03 11:55:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:25,436 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-03 11:55:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:25,437 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, (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 22 [2025-03-03 11:55:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:25,437 INFO L225 Difference]: With dead ends: 38 [2025-03-03 11:55:25,437 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 11:55:25,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-03 11:55:25,438 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 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-03 11:55:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 11:55:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 11:55:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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-03 11:55:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-03 11:55:25,442 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2025-03-03 11:55:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:25,442 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-03 11:55:25,442 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, (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-03 11:55:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-03 11:55:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 11:55:25,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:25,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:25,447 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-03 11:55:25,643 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-03 11:55:25,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:25,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1880039140, now seen corresponding path program 1 times [2025-03-03 11:55:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:25,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46794921] [2025-03-03 11:55:25,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:25,644 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-03 11:55:25,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:25,646 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-03 11:55:25,647 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-03 11:55:25,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 11:55:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 11:55:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:25,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:25,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 11:55:25,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:25,748 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-03 11:55:25,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:25,748 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:25,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46794921] [2025-03-03 11:55:25,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46794921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:25,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:25,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:55:25,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567309125] [2025-03-03 11:55:25,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:25,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:55:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:25,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:55:25,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:55:25,750 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:25,775 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-03 11:55:25,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:55:25,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-03 11:55:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:25,776 INFO L225 Difference]: With dead ends: 34 [2025-03-03 11:55:25,776 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 11:55:25,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:55:25,776 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:25,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 11:55:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-03 11:55:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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-03 11:55:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-03 11:55:25,784 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2025-03-03 11:55:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:25,786 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-03 11:55:25,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-03 11:55:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 11:55:25,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:25,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:25,791 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-03 11:55:25,987 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-03 11:55:25,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:25,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1934330154, now seen corresponding path program 1 times [2025-03-03 11:55:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:25,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143452427] [2025-03-03 11:55:25,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:25,988 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-03 11:55:25,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:25,990 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-03 11:55:25,991 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-03 11:55:26,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 11:55:26,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 11:55:26,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:26,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:26,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 11:55:26,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:26,164 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-03 11:55:26,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:26,165 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143452427] [2025-03-03 11:55:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143452427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:26,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:55:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193550043] [2025-03-03 11:55:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:26,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:55:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:26,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:55:26,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:55:26,166 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-03 11:55:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:26,332 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-03-03 11:55:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 11:55:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-03 11:55:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:26,333 INFO L225 Difference]: With dead ends: 45 [2025-03-03 11:55:26,334 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 11:55:26,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:55:26,334 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:26,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:55:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 11:55:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-03 11:55:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 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-03 11:55:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-03 11:55:26,340 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 23 [2025-03-03 11:55:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:26,340 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-03 11:55:26,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-03 11:55:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-03 11:55:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 11:55:26,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:26,341 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-03 11:55:26,344 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 (9)] Ended with exit code 0 [2025-03-03 11:55:26,541 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-03 11:55:26,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:26,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1040704247, now seen corresponding path program 1 times [2025-03-03 11:55:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655183236] [2025-03-03 11:55:26,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:26,543 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-03 11:55:26,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:26,546 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-03 11:55:26,547 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-03 11:55:26,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 11:55:26,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 11:55:26,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:26,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:26,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:26,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:26,616 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-03 11:55:26,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:26,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655183236] [2025-03-03 11:55:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655183236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125614052] [2025-03-03 11:55:26,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:26,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:26,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:26,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:26,617 INFO L87 Difference]: Start difference. First operand 31 states and 37 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-03 11:55:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:26,639 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-03-03 11:55:26,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:26,640 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-03 11:55:26,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:26,640 INFO L225 Difference]: With dead ends: 41 [2025-03-03 11:55:26,640 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 11:55:26,640 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-03 11:55:26,641 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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-03 11:55:26,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 11:55:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-03 11:55:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 11:55:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-03-03 11:55:26,644 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2025-03-03 11:55:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:26,644 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-03-03 11:55:26,645 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-03 11:55:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-03-03 11:55:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 11:55:26,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:26,646 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-03 11:55:26,649 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 (10)] Ended with exit code 0 [2025-03-03 11:55:26,846 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-03 11:55:26,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:26,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 170856871, now seen corresponding path program 1 times [2025-03-03 11:55:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:26,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138906402] [2025-03-03 11:55:26,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:26,847 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-03 11:55:26,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:26,849 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-03 11:55:26,850 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-03 11:55:26,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 11:55:26,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 11:55:26,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:26,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:26,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 11:55:26,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:26,976 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-03 11:55:26,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:26,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138906402] [2025-03-03 11:55:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138906402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:26,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:26,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:55:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589842540] [2025-03-03 11:55:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:26,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:55:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:26,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:55:26,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:55:26,977 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-03 11:55:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:27,081 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-03 11:55:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:55:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-03 11:55:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:27,085 INFO L225 Difference]: With dead ends: 38 [2025-03-03 11:55:27,085 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 11:55:27,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:55:27,085 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:27,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:55:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 11:55:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 11:55:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-03 11:55:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-03 11:55:27,087 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2025-03-03 11:55:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:27,087 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-03 11:55:27,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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-03 11:55:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-03 11:55:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 11:55:27,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:27,088 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:27,094 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-03 11:55:27,288 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-03 11:55:27,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1432350456, now seen corresponding path program 1 times [2025-03-03 11:55:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100528959] [2025-03-03 11:55:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:27,289 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-03 11:55:27,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:27,291 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-03 11:55:27,292 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-03 11:55:27,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:55:27,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:55:27,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:27,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:55:27,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:55:27,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:55:27,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:55:27,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:27,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:55:27,410 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-03 11:55:27,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:55:27,411 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:55:27,417 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-03 11:55:27,612 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-03 11:55:27,614 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:27,634 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:55:27,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:55:27 BoogieIcfgContainer [2025-03-03 11:55:27,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:55:27,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:55:27,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:55:27,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:55:27,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:22" (3/4) ... [2025-03-03 11:55:27,639 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 11:55:27,667 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 20. [2025-03-03 11:55:27,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 11:55:27,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 11:55:27,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:55:27,723 INFO L158 Benchmark]: Toolchain (without parser) took 5611.21ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 56.1MB in the end (delta: 36.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-03-03 11:55:27,723 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:27,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.24ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 80.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:27,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.81ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:27,724 INFO L158 Benchmark]: Boogie Preprocessor took 50.14ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:27,724 INFO L158 Benchmark]: IcfgBuilder took 327.07ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 63.0MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:27,725 INFO L158 Benchmark]: TraceAbstraction took 4894.30ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 232B). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2025-03-03 11:55:27,725 INFO L158 Benchmark]: Witness Printer took 85.17ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 56.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:27,726 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.36ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.24ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 80.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.81ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.14ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.07ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 63.0MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4894.30ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 232B). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Witness Printer took 85.17ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 56.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 82]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L76] double x = -0.0; [L77] double y = 0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L28] COND TRUE 0 [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L28] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=-2147483648, x=0.0] [L30-L31] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(x) == 0) [L50] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L28] COND TRUE 0 [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L28] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=0, x=0.0] [L30-L31] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L50] RET, EXPR __fpclassify_double(y) VAL [x=0.0, y=0.0] [L50] COND FALSE !(__fpclassify_double(y) == 0) [L53] return x < y ? x : y; VAL [\result=0.0] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] CALL, EXPR __signbit_double(res) [L57] __uint32_t msw; VAL [x=0.0] [L63] COND TRUE 0 [L60] ieee_double_shape_type gh_u; [L61] gh_u.value = (x) [L62] EXPR gh_u.parts.msw [L62] (msw) = gh_u.parts.msw [L63] COND FALSE !(0) VAL [msw=0, x=0.0] [L65] return (msw & 0x80000000) != 0; VAL [\result=0, x=0.0] [L81] RET, EXPR __signbit_double(res) [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 766 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 259 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 181 ConstructedInterpolants, 24 QuantifiedInterpolants, 750 SizeOfPredicates, 15 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 30/30 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 proved your program to be incorrect! [2025-03-03 11:55:27,746 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE