./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i -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 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:49:38,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:49:38,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:49:38,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:49:38,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:49:38,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:49:38,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:49:38,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:49:38,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:49:38,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:49:38,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:49:38,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:49:38,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:49:38,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:49:38,665 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:49:38,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:38,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:49:38,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:49:38,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:49:38,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:49:38,668 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 -> 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 [2025-03-17 02:49:38,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:49:38,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:49:38,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:49:38,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:49:38,891 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:49:38,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-17 02:49:39,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3b3cf5d/a0b12207632e4cf3ab207258c2f3ffbf/FLAG67cc45454 [2025-03-17 02:49:40,173 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:49:40,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-17 02:49:40,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3b3cf5d/a0b12207632e4cf3ab207258c2f3ffbf/FLAG67cc45454 [2025-03-17 02:49:40,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3b3cf5d/a0b12207632e4cf3ab207258c2f3ffbf [2025-03-17 02:49:40,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:49:40,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:49:40,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:40,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:49:40,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:49:40,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487b905f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40, skipping insertion in model container [2025-03-17 02:49:40,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:49:40,670 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i[916,929] [2025-03-17 02:49:40,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:40,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:49:40,734 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i[916,929] [2025-03-17 02:49:40,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:40,771 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:49:40,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40 WrapperNode [2025-03-17 02:49:40,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:40,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:40,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:49:40,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:49:40,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,811 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-17 02:49:40,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:40,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:49:40,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:49:40,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:49:40,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,847 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:49:40,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:49:40,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:49:40,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:49:40,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:49:40,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (1/1) ... [2025-03-17 02:49:40,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:40,900 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-17 02:49:40,903 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-17 02:49:40,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:49:40,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:49:40,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:49:40,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:49:40,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:49:40,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:49:40,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:49:40,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:49:41,166 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc property_#t~bitwise8#1;havoc property_#t~short9#1; [2025-03-17 02:49:41,182 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:49:41,182 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:49:41,193 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:49:41,195 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:49:41,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:41 BoogieIcfgContainer [2025-03-17 02:49:41,195 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:49:41,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:49:41,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:49:41,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:49:41,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:49:40" (1/3) ... [2025-03-17 02:49:41,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f142346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:41, skipping insertion in model container [2025-03-17 02:49:41,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:40" (2/3) ... [2025-03-17 02:49:41,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f142346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:41, skipping insertion in model container [2025-03-17 02:49:41,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:41" (3/3) ... [2025-03-17 02:49:41,203 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-17 02:49:41,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:49:41,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-9.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:49:41,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:49:41,264 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;@11c66a6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:49:41,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:49:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 02:49:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 02:49:41,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:41,274 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:41,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1275629632, now seen corresponding path program 1 times [2025-03-17 02:49:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:41,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43824715] [2025-03-17 02:49:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:41,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 02:49:41,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 02:49:41,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:41,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 02:49:41,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43824715] [2025-03-17 02:49:41,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43824715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:49:41,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118751777] [2025-03-17 02:49:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:41,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:41,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:41,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:49:41,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:49:41,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 02:49:41,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 02:49:41,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:41,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:41,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:49:41,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 02:49:41,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:49:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118751777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:49:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:49:41,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754352063] [2025-03-17 02:49:41,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:41,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:49:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:41,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:49:41,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:49:41,561 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 02:49:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:41,581 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2025-03-17 02:49:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:49:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-17 02:49:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:41,590 INFO L225 Difference]: With dead ends: 69 [2025-03-17 02:49:41,590 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 02:49:41,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 43 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-17 02:49:41,597 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:41,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:49:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 02:49:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 02:49:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 02:49:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-17 02:49:41,633 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 42 [2025-03-17 02:49:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:41,634 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-17 02:49:41,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 02:49:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-03-17 02:49:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 02:49:41,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:41,637 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:41,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:49:41,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:49:41,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 881488287, now seen corresponding path program 1 times [2025-03-17 02:49:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603583673] [2025-03-17 02:49:41,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:41,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 02:49:41,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 02:49:41,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:41,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 02:49:42,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603583673] [2025-03-17 02:49:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603583673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:42,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:49:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:49:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751919172] [2025-03-17 02:49:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:42,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:49:42,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:42,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:49:42,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:49:42,303 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:42,350 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-03-17 02:49:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:49:42,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2025-03-17 02:49:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:42,351 INFO L225 Difference]: With dead ends: 68 [2025-03-17 02:49:42,351 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 02:49:42,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:49:42,352 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 99 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:49:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 02:49:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-03-17 02:49:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 02:49:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-17 02:49:42,356 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 42 [2025-03-17 02:49:42,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:42,357 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-17 02:49:42,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-17 02:49:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 02:49:42,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:42,358 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:42,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:49:42,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:42,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash 175287165, now seen corresponding path program 1 times [2025-03-17 02:49:42,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:42,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842351838] [2025-03-17 02:49:42,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:42,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:42,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:49:42,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:49:42,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:42,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 02:49:45,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842351838] [2025-03-17 02:49:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842351838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:49:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:49:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148769718] [2025-03-17 02:49:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:45,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:49:45,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:45,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:49:45,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:49:45,973 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:46,162 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2025-03-17 02:49:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:49:46,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2025-03-17 02:49:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:46,164 INFO L225 Difference]: With dead ends: 121 [2025-03-17 02:49:46,164 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 02:49:46,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:49:46,165 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:46,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 129 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:49:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 02:49:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59. [2025-03-17 02:49:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:49:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2025-03-17 02:49:46,179 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 44 [2025-03-17 02:49:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:46,179 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2025-03-17 02:49:46,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2025-03-17 02:49:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 02:49:46,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:46,180 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:49:46,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash -330271460, now seen corresponding path program 1 times [2025-03-17 02:49:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:46,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573209162] [2025-03-17 02:49:46,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:46,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:49:46,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:49:46,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:46,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 02:49:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573209162] [2025-03-17 02:49:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573209162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:49:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722147544] [2025-03-17 02:49:46,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:46,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:46,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:46,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:49:46,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:49:46,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:49:46,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:49:46,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:46,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:46,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 02:49:46,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 02:49:46,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:49:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722147544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:46,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:49:46,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-17 02:49:46,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545270130] [2025-03-17 02:49:46,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:46,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:49:46,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:46,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:49:46,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:49:46,441 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:46,529 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2025-03-17 02:49:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:49:46,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2025-03-17 02:49:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:46,530 INFO L225 Difference]: With dead ends: 158 [2025-03-17 02:49:46,530 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 02:49:46,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:49:46,531 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 71 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:46,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 120 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:49:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 02:49:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2025-03-17 02:49:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 67 states have internal predecessors, (82), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:49:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2025-03-17 02:49:46,546 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 44 [2025-03-17 02:49:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2025-03-17 02:49:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2025-03-17 02:49:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 02:49:46,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:46,547 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:46,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:49:46,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 02:49:46,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:46,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -461126414, now seen corresponding path program 1 times [2025-03-17 02:49:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141776281] [2025-03-17 02:49:46,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:46,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 02:49:46,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 02:49:46,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:46,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:49:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818137617] [2025-03-17 02:49:46,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:46,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:49:46,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 02:49:46,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 02:49:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 02:49:46,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:46,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:49:46,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:49:46,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 02:49:46,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 02:49:46,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:46,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:49:46,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:49:46,887 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:49:46,888 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:49:46,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 02:49:47,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:47,096 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 02:49:47,136 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:49:47,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:49:47 BoogieIcfgContainer [2025-03-17 02:49:47,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:49:47,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:49:47,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:49:47,140 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:49:47,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:41" (3/4) ... [2025-03-17 02:49:47,142 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:49:47,142 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:49:47,143 INFO L158 Benchmark]: Toolchain (without parser) took 6610.71ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 133.2MB in the beginning and 266.6MB in the end (delta: -133.5MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2025-03-17 02:49:47,143 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:49:47,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.69ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:49:47,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.44ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 118.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:49:47,144 INFO L158 Benchmark]: Boogie Preprocessor took 45.08ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 115.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:49:47,145 INFO L158 Benchmark]: IcfgBuilder took 334.46ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 99.1MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:49:47,145 INFO L158 Benchmark]: TraceAbstraction took 5942.25ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 98.3MB in the beginning and 266.7MB in the end (delta: -168.4MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-03-17 02:49:47,145 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 360.7MB. Free memory was 266.7MB in the beginning and 266.6MB in the end (delta: 110.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:49:47,146 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.69ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 120.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.44ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 118.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.08ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 115.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 334.46ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 99.1MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5942.25ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 98.3MB in the beginning and 266.7MB in the end (delta: -168.4MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 360.7MB. Free memory was 266.7MB in the beginning and 266.6MB in the end (delta: 110.8kB). 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 81, overapproximation of shiftLeft at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed long int var_1_14 = -16; [L31] unsigned char last_1_var_1_1 = 10; [L32] double last_1_var_1_10 = 9.2; [L33] signed short int last_1_var_1_12 = 1; [L34] signed long int last_1_var_1_14 = -16; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L75] last_1_var_1_1 = var_1_1 [L76] last_1_var_1_10 = var_1_10 [L77] last_1_var_1_12 = var_1_12 [L78] last_1_var_1_14 = var_1_14 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L67] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L67] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L68] var_1_7 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_8=100, var_1_9=32] [L69] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_8=100, var_1_9=32] [L70] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L70] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L89] RET updateVariables() [L90] CALL step() [L38] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=1, var_1_10=46/5, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L39] COND TRUE ((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0 [L40] var_1_12 = ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=-16, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L45] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=100, var_1_9=32] [L45] COND TRUE (10 << var_1_12) < (var_1_3 * var_1_14) [L46] var_1_8 = (var_1_12 + var_1_14) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=46/5, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=10, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=64] [L50] COND TRUE var_1_12 <= 16 [L51] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=-254, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=64] [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=-254, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=64] [L81] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=-254, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=64] [L81] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=-254, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=64] [L81-L82] return ((((((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? (var_1_12 == ((signed short int) ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : (var_1_12 == ((signed short int) last_1_var_1_12)))) && (var_1_14 == ((signed long int) var_1_12)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=-254, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=2, var_1_11=2, var_1_12=10, var_1_14=10, var_1_1=-254, var_1_3=-254, var_1_7=0, var_1_8=20, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 55 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 178 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 69 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 741 SizeOfPredicates, 2 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 220/240 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-17 02:49:47,164 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i -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 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:49:49,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:49:49,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:49:49,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:49:49,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:49:49,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:49:49,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:49:49,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:49:49,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:49:49,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:49:49,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:49:49,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:49:49,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:49:49,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:49:49,333 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:49:49,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:49:49,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:49:49,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:49:49,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:49:49,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:49:49,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:49:49,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:49,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:49:49,335 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:49:49,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:49:49,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:49:49,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:49:49,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:49:49,336 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 -> 8c739365ea97b8d8f582c1641d81069a58ff4a5e699a71dc4c2b9835245908d7 [2025-03-17 02:49:49,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:49:49,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:49:49,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:49:49,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:49:49,612 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:49:49,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-17 02:49:50,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c277d413e/e6959a3e2d1f4a0cafe3960d4660485c/FLAG68b98af27 [2025-03-17 02:49:51,116 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:49:51,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-17 02:49:51,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c277d413e/e6959a3e2d1f4a0cafe3960d4660485c/FLAG68b98af27 [2025-03-17 02:49:51,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c277d413e/e6959a3e2d1f4a0cafe3960d4660485c [2025-03-17 02:49:51,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:49:51,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:49:51,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:51,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:49:51,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:49:51,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2544d682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51, skipping insertion in model container [2025-03-17 02:49:51,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:49:51,596 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i[916,929] [2025-03-17 02:49:51,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:51,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:49:51,664 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i[916,929] [2025-03-17 02:49:51,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:51,695 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:49:51,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51 WrapperNode [2025-03-17 02:49:51,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:51,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:51,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:49:51,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:49:51,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,725 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2025-03-17 02:49:51,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:51,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:49:51,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:49:51,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:49:51,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,743 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:49:51,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:49:51,755 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:49:51,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:49:51,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:49:51,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (1/1) ... [2025-03-17 02:49:51,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:51,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:51,784 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-17 02:49:51,793 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-17 02:49:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:49:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:49:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:49:51,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:49:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:49:51,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:49:51,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:49:51,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:49:52,092 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:49:52,092 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:49:52,106 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:49:52,107 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:49:52,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:52 BoogieIcfgContainer [2025-03-17 02:49:52,107 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:49:52,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:49:52,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:49:52,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:49:52,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:49:51" (1/3) ... [2025-03-17 02:49:52,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a316519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:52, skipping insertion in model container [2025-03-17 02:49:52,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:51" (2/3) ... [2025-03-17 02:49:52,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a316519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:52, skipping insertion in model container [2025-03-17 02:49:52,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:52" (3/3) ... [2025-03-17 02:49:52,117 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-9.i [2025-03-17 02:49:52,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:49:52,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-9.i that has 2 procedures, 28 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:49:52,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:49:52,184 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;@3fbdff14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:49:52,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:49:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 02:49:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 02:49:52,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:52,194 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:52,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:52,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1484377526, now seen corresponding path program 1 times [2025-03-17 02:49:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:49:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891933960] [2025-03-17 02:49:52,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:52,208 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-17 02:49:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:49:52,211 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-17 02:49:52,214 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-17 02:49:52,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 02:49:52,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 02:49:52,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:52,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:52,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:49:52,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 02:49:52,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:49:52,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:49:52,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891933960] [2025-03-17 02:49:52,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891933960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:52,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:49:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:49:52,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935572595] [2025-03-17 02:49:52,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:52,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:49:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:49:52,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:49:52,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:49:52,400 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:52,416 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2025-03-17 02:49:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:49:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2025-03-17 02:49:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:52,425 INFO L225 Difference]: With dead ends: 52 [2025-03-17 02:49:52,425 INFO L226 Difference]: Without dead ends: 25 [2025-03-17 02:49:52,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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-17 02:49:52,431 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:52,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:49:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-17 02:49:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 02:49:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 02:49:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-03-17 02:49:52,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 38 [2025-03-17 02:49:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:52,468 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-03-17 02:49:52,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-03-17 02:49:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 02:49:52,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:52,470 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:52,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:49:52,675 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-17 02:49:52,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:52,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash 610991017, now seen corresponding path program 1 times [2025-03-17 02:49:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:49:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487997210] [2025-03-17 02:49:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:52,677 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-17 02:49:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:49:52,682 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-17 02:49:52,683 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-17 02:49:52,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 02:49:52,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 02:49:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:52,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 02:49:52,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 02:49:53,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:49:53,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:49:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487997210] [2025-03-17 02:49:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487997210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:49:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:49:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194056708] [2025-03-17 02:49:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:49:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:49:53,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:49:53,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:49:53,108 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:53,291 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2025-03-17 02:49:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:49:53,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2025-03-17 02:49:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:53,293 INFO L225 Difference]: With dead ends: 73 [2025-03-17 02:49:53,293 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 02:49:53,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:49:53,295 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:49:53,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 85 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:49:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 02:49:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2025-03-17 02:49:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 02:49:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-17 02:49:53,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 38 [2025-03-17 02:49:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:53,310 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-17 02:49:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 02:49:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-03-17 02:49:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 02:49:53,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:53,311 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:49:53,316 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:49:53,511 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-17 02:49:53,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:53,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:53,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1941165944, now seen corresponding path program 1 times [2025-03-17 02:49:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:49:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635496264] [2025-03-17 02:49:53,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:53,513 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-17 02:49:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:49:53,517 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-17 02:49:53,518 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-17 02:49:53,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 02:49:53,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 02:49:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:53,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 02:49:53,613 INFO L279 TraceCheckSpWp]: Computing forward predicates...