./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.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_fillercode_fillercodesize_ps-cn-250_file-11.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 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:02:12,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:02:12,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:02:12,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:02:12,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:02:12,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:02:12,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:02:12,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:02:12,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:02:12,249 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:02:12,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:02:12,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:02:12,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:02:12,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:02:12,249 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:02:12,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:02:12,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:02:12,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:12,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:02:12,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:02:12,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:02:12,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:02:12,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:02:12,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:02:12,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:02:12,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:02:12,252 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 -> 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f [2025-03-17 00:02:12,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:02:12,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:02:12,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:02:12,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:02:12,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:02:12,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-17 00:02:14,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84af66504/0531ebe390a94323a377d24151f09424/FLAGf6d8dc011 [2025-03-17 00:02:14,623 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:02:14,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-17 00:02:14,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84af66504/0531ebe390a94323a377d24151f09424/FLAGf6d8dc011 [2025-03-17 00:02:14,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84af66504/0531ebe390a94323a377d24151f09424 [2025-03-17 00:02:14,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:02:14,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:02:14,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:14,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:02:14,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:02:14,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:14" (1/1) ... [2025-03-17 00:02:14,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1886ba4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:14, skipping insertion in model container [2025-03-17 00:02:14,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:14" (1/1) ... [2025-03-17 00:02:14,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:02:14,955 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_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-03-17 00:02:15,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:15,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:02:15,189 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_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-03-17 00:02:15,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:15,326 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:02:15,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15 WrapperNode [2025-03-17 00:02:15,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:15,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:15,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:02:15,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:02:15,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,449 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-03-17 00:02:15,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:15,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:02:15,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:02:15,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:02:15,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,513 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 00:02:15,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:02:15,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:02:15,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:02:15,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:02:15,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (1/1) ... [2025-03-17 00:02:15,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:15,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:15,641 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 00:02:15,643 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 00:02:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:02:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:02:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:02:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:02:15,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:02:15,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:02:15,830 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:02:15,832 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:02:16,982 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 00:02:16,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:02:17,050 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:02:17,052 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:02:17,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:17 BoogieIcfgContainer [2025-03-17 00:02:17,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:02:17,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:02:17,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:02:17,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:02:17,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:02:14" (1/3) ... [2025-03-17 00:02:17,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7b233d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:17, skipping insertion in model container [2025-03-17 00:02:17,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:15" (2/3) ... [2025-03-17 00:02:17,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7b233d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:17, skipping insertion in model container [2025-03-17 00:02:17,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:17" (3/3) ... [2025-03-17 00:02:17,076 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-17 00:02:17,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:02:17,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i that has 2 procedures, 232 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:02:17,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:02:17,191 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;@5e355051, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:02:17,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:02:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 149 states have internal predecessors, (229), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:02:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:02:17,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:17,229 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:17,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:17,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1940589001, now seen corresponding path program 1 times [2025-03-17 00:02:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875923777] [2025-03-17 00:02:17,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:17,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:02:17,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:02:17,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:17,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-17 00:02:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875923777] [2025-03-17 00:02:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875923777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116479561] [2025-03-17 00:02:18,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:18,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:18,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:18,197 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 00:02:18,203 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 00:02:18,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:02:18,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:02:18,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:18,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:18,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:02:18,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-17 00:02:18,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:02:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116479561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:02:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:02:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825931208] [2025-03-17 00:02:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:02:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:18,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:02:18,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:02:18,788 INFO L87 Difference]: Start difference. First operand has 232 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 149 states have internal predecessors, (229), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:02:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:18,877 INFO L93 Difference]: Finished difference Result 461 states and 861 transitions. [2025-03-17 00:02:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:02:18,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) Word has length 492 [2025-03-17 00:02:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:18,903 INFO L225 Difference]: With dead ends: 461 [2025-03-17 00:02:18,903 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 00:02:18,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 493 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 00:02:18,909 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:18,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 00:02:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-03-17 00:02:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 147 states have (on average 1.5170068027210883) internal successors, (223), 147 states have internal predecessors, (223), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:02:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 385 transitions. [2025-03-17 00:02:19,034 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 385 transitions. Word has length 492 [2025-03-17 00:02:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:19,038 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 385 transitions. [2025-03-17 00:02:19,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:02:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 385 transitions. [2025-03-17 00:02:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-17 00:02:19,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:19,058 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:19,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:02:19,259 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 00:02:19,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:19,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:19,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2113230694, now seen corresponding path program 1 times [2025-03-17 00:02:19,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:19,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642727322] [2025-03-17 00:02:19,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:19,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-17 00:02:19,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-17 00:02:19,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:19,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:02:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642727322] [2025-03-17 00:02:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642727322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849793158] [2025-03-17 00:02:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:19,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:19,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:19,929 INFO L87 Difference]: Start difference. First operand 230 states and 385 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:20,146 INFO L93 Difference]: Finished difference Result 587 states and 985 transitions. [2025-03-17 00:02:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 492 [2025-03-17 00:02:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:20,158 INFO L225 Difference]: With dead ends: 587 [2025-03-17 00:02:20,162 INFO L226 Difference]: Without dead ends: 358 [2025-03-17 00:02:20,164 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 00:02:20,165 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 226 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:20,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 873 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:02:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-17 00:02:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 355. [2025-03-17 00:02:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 240 states have (on average 1.5541666666666667) internal successors, (373), 241 states have internal predecessors, (373), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 00:02:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 597 transitions. [2025-03-17 00:02:20,229 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 597 transitions. Word has length 492 [2025-03-17 00:02:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:20,230 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 597 transitions. [2025-03-17 00:02:20,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 597 transitions. [2025-03-17 00:02:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-17 00:02:20,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:20,234 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:20,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:02:20,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:20,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1284656290, now seen corresponding path program 1 times [2025-03-17 00:02:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271323948] [2025-03-17 00:02:20,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:20,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:20,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-17 00:02:20,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-17 00:02:20,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:20,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:02:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271323948] [2025-03-17 00:02:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271323948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:02:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203601795] [2025-03-17 00:02:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:20,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:20,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:20,928 INFO L87 Difference]: Start difference. First operand 355 states and 597 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:21,794 INFO L93 Difference]: Finished difference Result 977 states and 1637 transitions. [2025-03-17 00:02:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 493 [2025-03-17 00:02:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:21,807 INFO L225 Difference]: With dead ends: 977 [2025-03-17 00:02:21,812 INFO L226 Difference]: Without dead ends: 623 [2025-03-17 00:02:21,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:21,815 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 654 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:21,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 920 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:02:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-17 00:02:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 588. [2025-03-17 00:02:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 435 states have (on average 1.6022988505747127) internal successors, (697), 438 states have internal predecessors, (697), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 143 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-17 00:02:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 989 transitions. [2025-03-17 00:02:21,934 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 989 transitions. Word has length 493 [2025-03-17 00:02:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:21,937 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 989 transitions. [2025-03-17 00:02:21,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 989 transitions. [2025-03-17 00:02:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-17 00:02:21,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:21,942 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:21,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:02:21,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:21,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1772830865, now seen corresponding path program 1 times [2025-03-17 00:02:21,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971816845] [2025-03-17 00:02:21,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:21,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-17 00:02:22,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-17 00:02:22,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:22,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:02:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971816845] [2025-03-17 00:02:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971816845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:02:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414879460] [2025-03-17 00:02:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:23,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:23,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:23,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:23,925 INFO L87 Difference]: Start difference. First operand 588 states and 989 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:24,085 INFO L93 Difference]: Finished difference Result 1209 states and 2026 transitions. [2025-03-17 00:02:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:24,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 494 [2025-03-17 00:02:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:24,090 INFO L225 Difference]: With dead ends: 1209 [2025-03-17 00:02:24,090 INFO L226 Difference]: Without dead ends: 622 [2025-03-17 00:02:24,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:24,092 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 35 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:24,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 744 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:02:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-17 00:02:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 604. [2025-03-17 00:02:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 451 states have (on average 1.598669623059867) internal successors, (721), 454 states have internal predecessors, (721), 146 states have call successors, (146), 6 states have call predecessors, (146), 6 states have return successors, (146), 143 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-17 00:02:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1013 transitions. [2025-03-17 00:02:24,173 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1013 transitions. Word has length 494 [2025-03-17 00:02:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:24,178 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 1013 transitions. [2025-03-17 00:02:24,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1013 transitions. [2025-03-17 00:02:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-17 00:02:24,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:24,187 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:24,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:02:24,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:24,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1772801074, now seen corresponding path program 1 times [2025-03-17 00:02:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:24,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439392616] [2025-03-17 00:02:24,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:24,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-17 00:02:24,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-17 00:02:24,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:24,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:02:24,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:24,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439392616] [2025-03-17 00:02:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439392616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:24,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:02:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880722873] [2025-03-17 00:02:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:24,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:24,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:24,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:24,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:24,826 INFO L87 Difference]: Start difference. First operand 604 states and 1013 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:25,495 INFO L93 Difference]: Finished difference Result 1702 states and 2867 transitions. [2025-03-17 00:02:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:25,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 494 [2025-03-17 00:02:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:25,503 INFO L225 Difference]: With dead ends: 1702 [2025-03-17 00:02:25,504 INFO L226 Difference]: Without dead ends: 1099 [2025-03-17 00:02:25,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:25,508 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 346 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:25,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1316 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:02:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-17 00:02:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1021. [2025-03-17 00:02:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 784 states have (on average 1.6275510204081634) internal successors, (1276), 787 states have internal predecessors, (1276), 227 states have call successors, (227), 9 states have call predecessors, (227), 9 states have return successors, (227), 224 states have call predecessors, (227), 227 states have call successors, (227) [2025-03-17 00:02:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1730 transitions. [2025-03-17 00:02:25,625 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1730 transitions. Word has length 494 [2025-03-17 00:02:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:25,627 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1730 transitions. [2025-03-17 00:02:25,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1730 transitions. [2025-03-17 00:02:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-17 00:02:25,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:25,634 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:25,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:02:25,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:25,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1683902057, now seen corresponding path program 1 times [2025-03-17 00:02:25,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:25,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614453981] [2025-03-17 00:02:25,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:25,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-17 00:02:25,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-17 00:02:25,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:25,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:02:26,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:26,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614453981] [2025-03-17 00:02:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614453981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:26,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:26,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:02:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040581125] [2025-03-17 00:02:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:26,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:02:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:26,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:02:26,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:02:26,531 INFO L87 Difference]: Start difference. First operand 1021 states and 1730 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:26,667 INFO L93 Difference]: Finished difference Result 2433 states and 4124 transitions. [2025-03-17 00:02:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:02:26,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 495 [2025-03-17 00:02:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:26,686 INFO L225 Difference]: With dead ends: 2433 [2025-03-17 00:02:26,686 INFO L226 Difference]: Without dead ends: 1764 [2025-03-17 00:02:26,689 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 00:02:26,689 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 233 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:26,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 810 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2025-03-17 00:02:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1762. [2025-03-17 00:02:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1373 states have (on average 1.630735615440641) internal successors, (2239), 1379 states have internal predecessors, (2239), 373 states have call successors, (373), 15 states have call predecessors, (373), 15 states have return successors, (373), 367 states have call predecessors, (373), 373 states have call successors, (373) [2025-03-17 00:02:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2985 transitions. [2025-03-17 00:02:26,870 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2985 transitions. Word has length 495 [2025-03-17 00:02:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:26,871 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2985 transitions. [2025-03-17 00:02:26,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2985 transitions. [2025-03-17 00:02:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:02:26,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:26,876 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:02:26,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2008752093, now seen corresponding path program 1 times [2025-03-17 00:02:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162902547] [2025-03-17 00:02:26,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:26,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:02:27,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:02:27,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:27,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:02:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162902547] [2025-03-17 00:02:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162902547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:02:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438478278] [2025-03-17 00:02:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:02:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:27,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:02:27,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:02:27,957 INFO L87 Difference]: Start difference. First operand 1762 states and 2985 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:02:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:29,049 INFO L93 Difference]: Finished difference Result 6617 states and 11187 transitions. [2025-03-17 00:02:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:02:29,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 496 [2025-03-17 00:02:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:29,081 INFO L225 Difference]: With dead ends: 6617 [2025-03-17 00:02:29,081 INFO L226 Difference]: Without dead ends: 5948 [2025-03-17 00:02:29,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:02:29,086 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 1266 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:29,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1586 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 00:02:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2025-03-17 00:02:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3534. [2025-03-17 00:02:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3534 states, 2841 states have (on average 1.6427314325941569) internal successors, (4667), 2853 states have internal predecessors, (4667), 665 states have call successors, (665), 27 states have call predecessors, (665), 27 states have return successors, (665), 653 states have call predecessors, (665), 665 states have call successors, (665) [2025-03-17 00:02:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 5997 transitions. [2025-03-17 00:02:29,321 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 5997 transitions. Word has length 496 [2025-03-17 00:02:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 3534 states and 5997 transitions. [2025-03-17 00:02:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:02:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 5997 transitions. [2025-03-17 00:02:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:02:29,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:29,326 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:29,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:02:29,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:29,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 794243642, now seen corresponding path program 1 times [2025-03-17 00:02:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:29,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229325372] [2025-03-17 00:02:29,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:29,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:02:29,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:02:29,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:29,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:02:30,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229325372] [2025-03-17 00:02:30,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229325372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:30,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:02:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430132995] [2025-03-17 00:02:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:30,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:02:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:30,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:02:30,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:02:30,851 INFO L87 Difference]: Start difference. First operand 3534 states and 5997 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:44,263 INFO L93 Difference]: Finished difference Result 28570 states and 48224 transitions. [2025-03-17 00:02:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 00:02:44,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-03-17 00:02:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:44,537 INFO L225 Difference]: With dead ends: 28570 [2025-03-17 00:02:44,562 INFO L226 Difference]: Without dead ends: 25291 [2025-03-17 00:02:44,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=391, Invalid=1015, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 00:02:44,630 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4053 mSDsluCounter, 5447 mSDsCounter, 0 mSdLazyCounter, 3439 mSolverCounterSat, 1302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4053 SdHoareTripleChecker+Valid, 6293 SdHoareTripleChecker+Invalid, 4741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1302 IncrementalHoareTripleChecker+Valid, 3439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:44,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4053 Valid, 6293 Invalid, 4741 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1302 Valid, 3439 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-03-17 00:02:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25291 states. [2025-03-17 00:02:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25291 to 5406. [2025-03-17 00:02:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5406 states, 4377 states have (on average 1.6248572081334247) internal successors, (7112), 4385 states have internal predecessors, (7112), 977 states have call successors, (977), 51 states have call predecessors, (977), 51 states have return successors, (977), 969 states have call predecessors, (977), 977 states have call successors, (977) [2025-03-17 00:02:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5406 states to 5406 states and 9066 transitions. [2025-03-17 00:02:45,863 INFO L78 Accepts]: Start accepts. Automaton has 5406 states and 9066 transitions. Word has length 496 [2025-03-17 00:02:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:45,865 INFO L471 AbstractCegarLoop]: Abstraction has 5406 states and 9066 transitions. [2025-03-17 00:02:45,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:02:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5406 states and 9066 transitions. [2025-03-17 00:02:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:02:45,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:45,880 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:02:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:02:45,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:45,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2044372935, now seen corresponding path program 1 times [2025-03-17 00:02:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669469051] [2025-03-17 00:02:45,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:45,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:02:46,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:02:46,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:46,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 9 proven. 231 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:02:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669469051] [2025-03-17 00:02:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669469051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255552704] [2025-03-17 00:02:46,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:46,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:46,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:46,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:46,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:02:46,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:02:47,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:02:47,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:47,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:47,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 00:02:47,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:57,007 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 00:03:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 5135 proven. 405 refuted. 0 times theorem prover too weak. 7420 trivial. 0 not checked. [2025-03-17 00:03:05,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:03:33,260 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-17 00:03:33,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-03-17 00:03:33,261 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-17 00:03:33,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:03:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 00:03:33,463 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2025-03-17 00:03:33,469 INFO L158 Benchmark]: Toolchain (without parser) took 78711.76ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 112.9MB in the beginning and 819.6MB in the end (delta: -706.6MB). Peak memory consumption was 313.1MB. Max. memory is 16.1GB. [2025-03-17 00:03:33,469 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:03:33,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.61ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 89.6MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 00:03:33,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.91ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 81.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 00:03:33,469 INFO L158 Benchmark]: Boogie Preprocessor took 140.07ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 75.0MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:03:33,470 INFO L158 Benchmark]: IcfgBuilder took 1463.78ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 78.9MB in the end (delta: -4.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 00:03:33,470 INFO L158 Benchmark]: TraceAbstraction took 76409.60ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 78.2MB in the beginning and 819.6MB in the end (delta: -741.4MB). Peak memory consumption was 279.6MB. Max. memory is 16.1GB. [2025-03-17 00:03:33,471 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.88ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.61ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 89.6MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.91ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 81.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.07ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 75.0MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1463.78ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 78.9MB in the end (delta: -4.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 76409.60ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 78.2MB in the beginning and 819.6MB in the end (delta: -741.4MB). Peak memory consumption was 279.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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_fillercode_fillercodesize_ps-cn-250_file-11.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 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:03:35,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:03:35,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:03:35,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:03:35,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:03:35,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:03:35,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:03:35,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:03:35,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:03:35,283 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:03:35,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:03:35,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:03:35,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:03:35,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:03:35,285 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:03:35,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:03:35,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:03:35,285 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:03:35,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:03:35,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:03:35,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:03:35,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:03:35,287 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 -> 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f [2025-03-17 00:03:35,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:03:35,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:03:35,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:03:35,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:03:35,539 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:03:35,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-17 00:03:36,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbaab056/b888c261afc74908a413e9010a20fef1/FLAG2c3061f5e [2025-03-17 00:03:36,947 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:03:36,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-17 00:03:36,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbaab056/b888c261afc74908a413e9010a20fef1/FLAG2c3061f5e [2025-03-17 00:03:37,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbaab056/b888c261afc74908a413e9010a20fef1 [2025-03-17 00:03:37,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:03:37,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:03:37,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:03:37,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:03:37,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:03:37,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47bebc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37, skipping insertion in model container [2025-03-17 00:03:37,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:03:37,443 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_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-03-17 00:03:37,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:03:37,564 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:03:37,577 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_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-03-17 00:03:37,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:03:37,663 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:03:37,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37 WrapperNode [2025-03-17 00:03:37,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:03:37,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:03:37,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:03:37,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:03:37,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,719 INFO L138 Inliner]: procedures = 27, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 455 [2025-03-17 00:03:37,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:03:37,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:03:37,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:03:37,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:03:37,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,758 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 00:03:37,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:03:37,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:03:37,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:03:37,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:03:37,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (1/1) ... [2025-03-17 00:03:37,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:03:37,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:03:37,833 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 00:03:37,836 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 00:03:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:03:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:03:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:03:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:03:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:03:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:03:37,957 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:03:37,959 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:03:45,175 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 00:03:45,175 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:03:45,190 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:03:45,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:03:45,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:03:45 BoogieIcfgContainer [2025-03-17 00:03:45,190 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:03:45,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:03:45,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:03:45,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:03:45,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:03:37" (1/3) ... [2025-03-17 00:03:45,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737ac92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:03:45, skipping insertion in model container [2025-03-17 00:03:45,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:03:37" (2/3) ... [2025-03-17 00:03:45,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737ac92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:03:45, skipping insertion in model container [2025-03-17 00:03:45,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:03:45" (3/3) ... [2025-03-17 00:03:45,199 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-03-17 00:03:45,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:03:45,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i that has 2 procedures, 203 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:03:45,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:03:45,259 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;@76500e9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:03:45,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:03:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 120 states have internal predecessors, (181), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:03:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-17 00:03:45,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:45,282 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:03:45,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:45,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 184741337, now seen corresponding path program 1 times [2025-03-17 00:03:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:03:45,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301506869] [2025-03-17 00:03:45,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:45,297 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 00:03:45,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:03:45,299 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 00:03:45,300 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 00:03:45,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-17 00:03:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-17 00:03:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:46,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:03:46,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:03:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 5660 proven. 0 refuted. 0 times theorem prover too weak. 7300 trivial. 0 not checked. [2025-03-17 00:03:46,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:03:46,080 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:03:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301506869] [2025-03-17 00:03:46,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301506869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:46,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:46,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:03:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597066928] [2025-03-17 00:03:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:46,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:03:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:03:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:03:46,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:03:46,105 INFO L87 Difference]: Start difference. First operand has 203 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 120 states have internal predecessors, (181), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:03:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:46,152 INFO L93 Difference]: Finished difference Result 403 states and 765 transitions. [2025-03-17 00:03:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:03:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 489 [2025-03-17 00:03:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:46,159 INFO L225 Difference]: With dead ends: 403 [2025-03-17 00:03:46,159 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 00:03:46,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 488 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 00:03:46,164 INFO L435 NwaCegarLoop]: 337 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, 337 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 00:03:46,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:03:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 00:03:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-17 00:03:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 118 states have internal predecessors, (175), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:03:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 337 transitions. [2025-03-17 00:03:46,221 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 337 transitions. Word has length 489 [2025-03-17 00:03:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:46,223 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 337 transitions. [2025-03-17 00:03:46,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:03:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 337 transitions. [2025-03-17 00:03:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-17 00:03:46,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:46,235 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:03:46,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:03:46,435 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 00:03:46,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash -239989162, now seen corresponding path program 1 times [2025-03-17 00:03:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:03:46,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181066887] [2025-03-17 00:03:46,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:46,437 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 00:03:46,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:03:46,445 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 00:03:46,447 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 00:03:46,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-17 00:03:47,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-17 00:03:47,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:47,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:47,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 00:03:47,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:03:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6540 proven. 126 refuted. 0 times theorem prover too weak. 6294 trivial. 0 not checked. [2025-03-17 00:03:48,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:03:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 114 proven. 126 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:03:50,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:03:50,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181066887] [2025-03-17 00:03:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181066887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:03:50,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:03:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 00:03:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287490983] [2025-03-17 00:03:50,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:03:50,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:03:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:03:50,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:03:50,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:03:50,282 INFO L87 Difference]: Start difference. First operand 201 states and 337 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (124), 2 states have call predecessors, (124), 2 states have call successors, (124)