./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.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_operatoramount_amount10_file-54.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 a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:23:19,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:23:20,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:23:20,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:23:20,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:23:20,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:23:20,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:23:20,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:23:20,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:23:20,064 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:23:20,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:23:20,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:23:20,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:23:20,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:23:20,065 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:23:20,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:23:20,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:23:20,066 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:23:20,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:20,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:23:20,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:23:20,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:23:20,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:23:20,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:23:20,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:23:20,068 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 -> a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a [2025-03-17 04:23:20,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:23:20,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:23:20,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:23:20,335 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:23:20,335 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:23:20,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-17 04:23:21,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a88d7ce/a0620359c42b4490a0c32dfe276e57ea/FLAG7ee028dec [2025-03-17 04:23:21,775 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:23:21,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-17 04:23:21,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a88d7ce/a0620359c42b4490a0c32dfe276e57ea/FLAG7ee028dec [2025-03-17 04:23:21,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a88d7ce/a0620359c42b4490a0c32dfe276e57ea [2025-03-17 04:23:21,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:23:21,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:23:21,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:21,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:23:21,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:23:21,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f082a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21, skipping insertion in model container [2025-03-17 04:23:21,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:23:21,941 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_operatoramount_amount10_file-54.i[915,928] [2025-03-17 04:23:21,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:21,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:23:21,974 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_operatoramount_amount10_file-54.i[915,928] [2025-03-17 04:23:21,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:21,993 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:23:21,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21 WrapperNode [2025-03-17 04:23:21,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:21,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:21,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:23:21,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:23:21,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,017 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2025-03-17 04:23:22,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:22,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:23:22,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:23:22,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:23:22,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,032 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 04:23:22,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:23:22,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:23:22,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:23:22,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:23:22,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:22,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:22,066 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 04:23:22,068 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 04:23:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:23:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:23:22,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:23:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:23:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:23:22,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:23:22,135 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:23:22,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:23:22,266 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:23:22,267 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:23:22,275 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:23:22,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:23:22,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:22 BoogieIcfgContainer [2025-03-17 04:23:22,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:23:22,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:23:22,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:23:22,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:23:22,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:23:21" (1/3) ... [2025-03-17 04:23:22,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd7e8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:22, skipping insertion in model container [2025-03-17 04:23:22,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (2/3) ... [2025-03-17 04:23:22,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd7e8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:22, skipping insertion in model container [2025-03-17 04:23:22,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:22" (3/3) ... [2025-03-17 04:23:22,284 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2025-03-17 04:23:22,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:23:22,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-54.i that has 2 procedures, 28 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:23:22,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:23:22,350 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;@60812f43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:23:22,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:23:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 04:23:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 04:23:22,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:22,361 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 04:23:22,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:22,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 146087053, now seen corresponding path program 1 times [2025-03-17 04:23:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:22,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687857393] [2025-03-17 04:23:22,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:22,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:22,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:22,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:22,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 04:23:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687857393] [2025-03-17 04:23:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687857393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:23:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945811772] [2025-03-17 04:23:22,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:22,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:23:22,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:22,520 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 04:23:22,521 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 04:23:22,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:22,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:22,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:22,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:22,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:23:22,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 04:23:22,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:22,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945811772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:22,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:23:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:23:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169460272] [2025-03-17 04:23:22,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:22,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:23:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:22,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:23:22,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:22,646 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 04:23:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:22,658 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2025-03-17 04:23:22,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:23:22,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2025-03-17 04:23:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:22,662 INFO L225 Difference]: With dead ends: 53 [2025-03-17 04:23:22,663 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 04:23:22,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 04:23:22,666 INFO L435 NwaCegarLoop]: 35 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, 35 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 04:23:22,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 04:23:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 04:23:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 04:23:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-17 04:23:22,690 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 52 [2025-03-17 04:23:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:22,690 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-17 04:23:22,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 04:23:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-17 04:23:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 04:23:22,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:22,692 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 04:23:22,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:23:22,893 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 04:23:22,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:22,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1258205141, now seen corresponding path program 1 times [2025-03-17 04:23:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:22,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558999133] [2025-03-17 04:23:22,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:22,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:22,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:22,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:22,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 04:23:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558999133] [2025-03-17 04:23:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558999133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:23:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824724643] [2025-03-17 04:23:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:23,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:23:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:23,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:23:23,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:23:23,006 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 04:23:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:23,018 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2025-03-17 04:23:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:23:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 52 [2025-03-17 04:23:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:23,019 INFO L225 Difference]: With dead ends: 51 [2025-03-17 04:23:23,019 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 04:23:23,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:23:23,020 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:23,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 04:23:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 04:23:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 04:23:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-17 04:23:23,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 52 [2025-03-17 04:23:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:23,025 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-17 04:23:23,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 04:23:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-03-17 04:23:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 04:23:23,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:23,026 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 04:23:23,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:23:23,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1257281620, now seen corresponding path program 1 times [2025-03-17 04:23:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229380753] [2025-03-17 04:23:23,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:23,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:23,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:23,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:23,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:23:23,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:23:23,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:23,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:23,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:23,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:23:23,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:23:23,115 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:23:23,116 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:23:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:23:23,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:23:23,158 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:23:23,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:23:23 BoogieIcfgContainer [2025-03-17 04:23:23,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:23:23,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:23:23,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:23:23,163 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:23:23,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:22" (3/4) ... [2025-03-17 04:23:23,165 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:23:23,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:23:23,167 INFO L158 Benchmark]: Toolchain (without parser) took 1365.83ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 57.0MB in the end (delta: 74.6MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,168 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:23,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.27ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 120.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.13ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 118.7MB in the end (delta: 977.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:23,169 INFO L158 Benchmark]: Boogie Preprocessor took 20.41ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,169 INFO L158 Benchmark]: IcfgBuilder took 237.56ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 105.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,169 INFO L158 Benchmark]: TraceAbstraction took 885.18ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 57.0MB in the end (delta: 47.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,169 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 167.8MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:23,171 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.87ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.27ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 120.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.13ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 118.7MB in the end (delta: 977.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.41ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 237.56ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 105.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 885.18ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 57.0MB in the end (delta: 47.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 167.8MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryFLOATComparisonOperation at line 37, overapproximation of someBinaryFLOATComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999.25; [L23] float var_1_5 = 63.875; [L24] float var_1_6 = 25.05; [L25] signed long int var_1_7 = -4; [L26] float var_1_8 = 25.2; [L27] signed long int var_1_9 = 2; [L28] signed long int var_1_10 = 256; [L29] signed long int last_1_var_1_7 = -4; [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] CALL updateLastVariables() [L59] last_1_var_1_7 = var_1_7 [L69] RET updateLastVariables() [L70] CALL updateVariables() [L44] var_1_5 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L45] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_6=501/20, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L46] var_1_6 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L47] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_8=126/5, var_1_9=2] [L48] var_1_8 = __VERIFIER_nondet_float() [L49] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L49] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L50] CALL assume_abort_if_not(var_1_8 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L50] RET assume_abort_if_not(var_1_8 != 0.0F) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=2] [L51] var_1_9 = __VERIFIER_nondet_long() [L52] CALL assume_abort_if_not(var_1_9 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L52] RET assume_abort_if_not(var_1_9 >= -1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L53] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L53] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=256, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L54] var_1_10 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_10 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L55] RET assume_abort_if_not(var_1_10 >= -1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L56] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L56] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L70] RET updateVariables() [L71] CALL step() [L33] signed long int stepLocal_0 = last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-4, stepLocal_0=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L34] COND FALSE !(last_1_var_1_7 < stepLocal_0) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=-4, var_1_9=1073741823] [L37] COND TRUE (((((var_1_5 / var_1_8)) > (var_1_6)) ? ((var_1_5 / var_1_8)) : (var_1_6))) == var_1_1 [L38] var_1_7 = (var_1_9 + var_1_10) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=0, var_1_9=1073741823] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return ((last_1_var_1_7 < last_1_var_1_7) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && (((((((var_1_5 / var_1_8)) > (var_1_6)) ? ((var_1_5 / var_1_8)) : (var_1_6))) == var_1_1) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_10))) : (var_1_7 == ((signed long int) 50))) ; [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=0, var_1_9=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=-4, var_1_10=-1073741823, var_1_1=3997/4, var_1_7=0, var_1_9=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 47 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 322/336 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 04:23:23,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_operatoramount_amount10_file-54.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 a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:23:25,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:23:25,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:23:25,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:23:25,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:23:25,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:23:25,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:23:25,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:23:25,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:23:25,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:23:25,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:23:25,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:23:25,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:23:25,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:23:25,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:23:25,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:23:25,195 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:23:25,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:25,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:23:25,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:23:25,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:23:25,197 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 -> a107373962cca35af7d179f02239e8e00f5e366c836fd26959756f328d1ec34a [2025-03-17 04:23:25,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:23:25,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:23:25,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:23:25,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:23:25,479 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:23:25,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-17 04:23:26,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8e45274/4c1369662a374e03b7eba2becb58007d/FLAGa7c0a2aaf [2025-03-17 04:23:26,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:23:26,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-54.i [2025-03-17 04:23:26,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8e45274/4c1369662a374e03b7eba2becb58007d/FLAGa7c0a2aaf [2025-03-17 04:23:27,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8e45274/4c1369662a374e03b7eba2becb58007d [2025-03-17 04:23:27,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:23:27,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:23:27,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:27,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:23:27,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:23:27,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718f4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27, skipping insertion in model container [2025-03-17 04:23:27,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:23:27,389 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_operatoramount_amount10_file-54.i[915,928] [2025-03-17 04:23:27,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:27,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:23:27,432 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_operatoramount_amount10_file-54.i[915,928] [2025-03-17 04:23:27,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:27,461 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:23:27,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27 WrapperNode [2025-03-17 04:23:27,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:27,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:27,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:23:27,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:23:27,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,492 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2025-03-17 04:23:27,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:27,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:23:27,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:23:27,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:23:27,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,510 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 04:23:27,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:23:27,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:23:27,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:23:27,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:23:27,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (1/1) ... [2025-03-17 04:23:27,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:27,549 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 04:23:27,553 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 04:23:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:23:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:23:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:23:27,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:23:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:23:27,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:23:27,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:23:27,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:23:29,291 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:23:29,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:23:29,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:23:29,299 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:23:29,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:29 BoogieIcfgContainer [2025-03-17 04:23:29,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:23:29,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:23:29,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:23:29,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:23:29,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:23:27" (1/3) ... [2025-03-17 04:23:29,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa7dee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:29, skipping insertion in model container [2025-03-17 04:23:29,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:27" (2/3) ... [2025-03-17 04:23:29,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa7dee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:29, skipping insertion in model container [2025-03-17 04:23:29,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:29" (3/3) ... [2025-03-17 04:23:29,308 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-54.i [2025-03-17 04:23:29,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:23:29,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-54.i that has 2 procedures, 28 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:23:29,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:23:29,363 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;@29145740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:23:29,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:23:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 04:23:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 04:23:29,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:29,372 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 04:23:29,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:29,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 146087053, now seen corresponding path program 1 times [2025-03-17 04:23:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826680244] [2025-03-17 04:23:29,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:29,383 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 04:23:29,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:29,385 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 04:23:29,386 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 04:23:29,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:29,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:29,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:29,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:23:29,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 04:23:29,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:29,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:29,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826680244] [2025-03-17 04:23:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826680244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:29,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:29,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:23:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429563140] [2025-03-17 04:23:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:29,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:23:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:29,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:23:29,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:29,687 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 04:23:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:29,703 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2025-03-17 04:23:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:23:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2025-03-17 04:23:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:29,709 INFO L225 Difference]: With dead ends: 53 [2025-03-17 04:23:29,709 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 04:23:29,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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 04:23:29,714 INFO L435 NwaCegarLoop]: 35 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, 35 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 04:23:29,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 04:23:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 04:23:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 04:23:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-17 04:23:29,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 52 [2025-03-17 04:23:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:29,742 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-17 04:23:29,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 04:23:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-17 04:23:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 04:23:29,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:29,744 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 04:23:29,754 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 04:23:29,945 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 04:23:29,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1258205141, now seen corresponding path program 1 times [2025-03-17 04:23:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940757354] [2025-03-17 04:23:29,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:29,947 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 04:23:29,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:29,949 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 04:23:29,951 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 04:23:29,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:30,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:30,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:30,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:30,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 04:23:30,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 04:23:30,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:30,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940757354] [2025-03-17 04:23:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940757354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:30,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:23:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761179420] [2025-03-17 04:23:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:23:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:30,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:23:30,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:23:30,306 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 04:23:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:30,851 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2025-03-17 04:23:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:23:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 52 [2025-03-17 04:23:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:30,871 INFO L225 Difference]: With dead ends: 51 [2025-03-17 04:23:30,871 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 04:23:30,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:23:30,872 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:30,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:23:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 04:23:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 04:23:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 04:23:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-17 04:23:30,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 52 [2025-03-17 04:23:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:30,880 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-17 04:23:30,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 04:23:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-03-17 04:23:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 04:23:30,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:30,881 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 04:23:30,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 04:23:31,081 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 04:23:31,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:31,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:31,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1257281620, now seen corresponding path program 1 times [2025-03-17 04:23:31,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:31,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609847088] [2025-03-17 04:23:31,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:31,083 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 04:23:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:31,086 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 04:23:31,087 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 04:23:31,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:23:31,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:23:31,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:31,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:31,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:23:31,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:24:02,213 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 04:24:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 04:24:29,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:24:29,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:24:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609847088] [2025-03-17 04:24:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609847088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:24:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:24:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:24:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093215786] [2025-03-17 04:24:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:24:29,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:24:29,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:24:29,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:24:29,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:24:29,079 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 04:24:30,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:24:38,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:24:49,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:24:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:24:49,427 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-17 04:24:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:24:49,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 52 [2025-03-17 04:24:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:24:49,465 INFO L225 Difference]: With dead ends: 32 [2025-03-17 04:24:49,465 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 04:24:49,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:24:49,466 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:24:49,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2025-03-17 04:24:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 04:24:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-17 04:24:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 04:24:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-17 04:24:49,470 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 52 [2025-03-17 04:24:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:24:49,471 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-17 04:24:49,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 04:24:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-17 04:24:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 04:24:49,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:49,472 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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 04:24:49,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:24:49,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:24:49,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:49,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1257251829, now seen corresponding path program 1 times [2025-03-17 04:24:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:24:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324509046] [2025-03-17 04:24:49,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:49,673 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 04:24:49,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:24:49,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:24:49,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 04:24:49,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 04:24:49,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 04:24:49,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:24:49,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:24:49,884 INFO L279 TraceCheckSpWp]: Computing forward predicates...