./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.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 31da68eea262c34083df1fad46a5753e80d18ad2f5e3cbbafbfb2efef5c55c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:49:20,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:49:20,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:49:20,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:49:20,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:49:20,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:49:20,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:49:20,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:49:20,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:49:20,286 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:49:20,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:49:20,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:49:20,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:49:20,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:49:20,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:49:20,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:49:20,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:49:20,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:49:20,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:49:20,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:49:20,290 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:49:20,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:49:20,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:49:20,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:49:20,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:49:20,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:49:20,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:49:20,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:49:20,291 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 -> 31da68eea262c34083df1fad46a5753e80d18ad2f5e3cbbafbfb2efef5c55c33 [2025-03-03 19:49:20,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:49:20,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:49:20,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:49:20,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:49:20,547 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:49:20,548 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-65.i [2025-03-03 19:49:21,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16433dc16/e8ed98186a594efeb6c8c9705b373663/FLAG08728e22d [2025-03-03 19:49:22,067 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:49:22,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i [2025-03-03 19:49:22,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16433dc16/e8ed98186a594efeb6c8c9705b373663/FLAG08728e22d [2025-03-03 19:49:22,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16433dc16/e8ed98186a594efeb6c8c9705b373663 [2025-03-03 19:49:22,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:49:22,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:49:22,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:49:22,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:49:22,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:49:22,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22, skipping insertion in model container [2025-03-03 19:49:22,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:49:22,491 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-65.i[916,929] [2025-03-03 19:49:22,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:22,651 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:49:22,661 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-65.i[916,929] [2025-03-03 19:49:22,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:49:22,768 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:49:22,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22 WrapperNode [2025-03-03 19:49:22,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:49:22,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:22,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:49:22,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:49:22,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,850 INFO L138 Inliner]: procedures = 26, calls = 83, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 569 [2025-03-03 19:49:22,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:49:22,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:49:22,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:49:22,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:49:22,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,904 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-03 19:49:22,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:49:22,957 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:49:22,958 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:49:22,958 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:49:22,959 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (1/1) ... [2025-03-03 19:49:22,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:49:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:22,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:49:22,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:49:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:49:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:49:23,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:49:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:49:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:49:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:49:23,139 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:49:23,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:49:23,780 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc property_#t~bitwise53#1;havoc property_#t~short54#1;havoc property_#t~bitwise55#1;havoc property_#t~short56#1; [2025-03-03 19:49:23,881 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 19:49:23,882 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:49:23,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:49:23,914 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:49:23,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:23 BoogieIcfgContainer [2025-03-03 19:49:23,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:49:23,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:49:23,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:49:23,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:49:23,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:49:22" (1/3) ... [2025-03-03 19:49:23,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e501de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:23, skipping insertion in model container [2025-03-03 19:49:23,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:22" (2/3) ... [2025-03-03 19:49:23,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e501de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:23, skipping insertion in model container [2025-03-03 19:49:23,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:23" (3/3) ... [2025-03-03 19:49:23,923 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-65.i [2025-03-03 19:49:23,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:49:23,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-65.i that has 2 procedures, 231 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:49:23,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:49:24,006 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;@7229eadc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:49:24,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:49:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 158 states have (on average 1.5506329113924051) internal successors, (245), 159 states have internal predecessors, (245), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:49:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-03 19:49:24,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:24,028 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:24,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1583439552, now seen corresponding path program 1 times [2025-03-03 19:49:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679928337] [2025-03-03 19:49:24,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:24,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:24,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:24,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:24,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-03-03 19:49:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679928337] [2025-03-03 19:49:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679928337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128647998] [2025-03-03 19:49:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:24,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:24,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:24,581 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-03 19:49:24,583 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-03 19:49:24,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 19:49:24,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 19:49:24,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:24,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:24,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:49:24,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-03-03 19:49:24,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:49:24,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128647998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:24,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:49:24,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:49:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701017252] [2025-03-03 19:49:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:24,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:49:24,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:24,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:49:24,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:49:24,965 INFO L87 Difference]: Start difference. First operand has 231 states, 158 states have (on average 1.5506329113924051) internal successors, (245), 159 states have internal predecessors, (245), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-03 19:49:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:25,016 INFO L93 Difference]: Finished difference Result 454 states and 833 transitions. [2025-03-03 19:49:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:49:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) Word has length 454 [2025-03-03 19:49:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:25,025 INFO L225 Difference]: With dead ends: 454 [2025-03-03 19:49:25,026 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 19:49:25,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:49:25,036 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:25,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 19:49:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-03 19:49:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 154 states have internal predecessors, (232), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:49:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 372 transitions. [2025-03-03 19:49:25,108 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 372 transitions. Word has length 454 [2025-03-03 19:49:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:25,109 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 372 transitions. [2025-03-03 19:49:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-03 19:49:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 372 transitions. [2025-03-03 19:49:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-03 19:49:25,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:25,121 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:25,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:49:25,322 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-03 19:49:25,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1166702097, now seen corresponding path program 1 times [2025-03-03 19:49:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:25,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358338986] [2025-03-03 19:49:25,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:25,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-03 19:49:25,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-03 19:49:25,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:25,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:25,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:25,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358338986] [2025-03-03 19:49:25,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358338986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:25,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:25,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:25,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654594774] [2025-03-03 19:49:25,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:25,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:25,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:25,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:25,742 INFO L87 Difference]: Start difference. First operand 226 states and 372 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:25,859 INFO L93 Difference]: Finished difference Result 587 states and 971 transitions. [2025-03-03 19:49:25,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 455 [2025-03-03 19:49:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:25,868 INFO L225 Difference]: With dead ends: 587 [2025-03-03 19:49:25,869 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 19:49:25,870 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-03 19:49:25,871 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 212 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:25,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 844 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 19:49:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2025-03-03 19:49:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 264 states have (on average 1.5378787878787878) internal successors, (406), 265 states have internal predecessors, (406), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 19:49:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 594 transitions. [2025-03-03 19:49:25,923 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 594 transitions. Word has length 455 [2025-03-03 19:49:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:25,925 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 594 transitions. [2025-03-03 19:49:25,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 594 transitions. [2025-03-03 19:49:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 19:49:25,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:25,933 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:25,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:49:25,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 935146018, now seen corresponding path program 1 times [2025-03-03 19:49:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398565906] [2025-03-03 19:49:25,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:25,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 19:49:26,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 19:49:26,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:26,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398565906] [2025-03-03 19:49:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398565906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:26,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:26,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194749139] [2025-03-03 19:49:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:26,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:26,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:26,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:26,214 INFO L87 Difference]: Start difference. First operand 361 states and 594 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:26,316 INFO L93 Difference]: Finished difference Result 1058 states and 1742 transitions. [2025-03-03 19:49:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:26,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 456 [2025-03-03 19:49:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:26,324 INFO L225 Difference]: With dead ends: 1058 [2025-03-03 19:49:26,324 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 19:49:26,325 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-03 19:49:26,326 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 349 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:26,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 965 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 19:49:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2025-03-03 19:49:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 505 states have (on average 1.5207920792079208) internal successors, (768), 507 states have internal predecessors, (768), 188 states have call successors, (188), 4 states have call predecessors, (188), 4 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-03 19:49:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1144 transitions. [2025-03-03 19:49:26,428 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1144 transitions. Word has length 456 [2025-03-03 19:49:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:26,428 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1144 transitions. [2025-03-03 19:49:26,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1144 transitions. [2025-03-03 19:49:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 19:49:26,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:26,434 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:26,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:49:26,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1634340381, now seen corresponding path program 1 times [2025-03-03 19:49:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846766845] [2025-03-03 19:49:26,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:26,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 19:49:26,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 19:49:26,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:26,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:26,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:26,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846766845] [2025-03-03 19:49:26,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846766845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:26,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:26,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:26,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956987572] [2025-03-03 19:49:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:26,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:26,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:26,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:26,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:26,696 INFO L87 Difference]: Start difference. First operand 698 states and 1144 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:26,999 INFO L93 Difference]: Finished difference Result 1982 states and 3261 transitions. [2025-03-03 19:49:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:27,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 456 [2025-03-03 19:49:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:27,013 INFO L225 Difference]: With dead ends: 1982 [2025-03-03 19:49:27,014 INFO L226 Difference]: Without dead ends: 1248 [2025-03-03 19:49:27,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:27,020 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 772 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:27,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1171 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:49:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-03-03 19:49:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1238. [2025-03-03 19:49:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 953 states have (on average 1.5278069254984261) internal successors, (1456), 959 states have internal predecessors, (1456), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-03 19:49:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 2008 transitions. [2025-03-03 19:49:27,168 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 2008 transitions. Word has length 456 [2025-03-03 19:49:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:27,169 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 2008 transitions. [2025-03-03 19:49:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2008 transitions. [2025-03-03 19:49:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 19:49:27,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:27,175 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:27,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:49:27,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:27,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:27,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2043164606, now seen corresponding path program 1 times [2025-03-03 19:49:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277980312] [2025-03-03 19:49:27,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:27,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 19:49:27,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 19:49:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277980312] [2025-03-03 19:49:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277980312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:27,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190147230] [2025-03-03 19:49:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:27,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:27,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:27,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:27,376 INFO L87 Difference]: Start difference. First operand 1238 states and 2008 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:27,528 INFO L93 Difference]: Finished difference Result 3708 states and 6018 transitions. [2025-03-03 19:49:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:27,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 456 [2025-03-03 19:49:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:27,543 INFO L225 Difference]: With dead ends: 3708 [2025-03-03 19:49:27,543 INFO L226 Difference]: Without dead ends: 2473 [2025-03-03 19:49:27,548 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-03 19:49:27,549 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 355 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:27,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1041 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:49:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2025-03-03 19:49:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 1374. [2025-03-03 19:49:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1089 states have (on average 1.5133149678604223) internal successors, (1648), 1095 states have internal predecessors, (1648), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-03 19:49:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2200 transitions. [2025-03-03 19:49:27,675 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2200 transitions. Word has length 456 [2025-03-03 19:49:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:27,676 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2200 transitions. [2025-03-03 19:49:27,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2200 transitions. [2025-03-03 19:49:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:49:27,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:27,685 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:27,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:49:27,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:27,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1232316138, now seen corresponding path program 1 times [2025-03-03 19:49:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169699337] [2025-03-03 19:49:27,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:27,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:49:27,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:49:27,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:27,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169699337] [2025-03-03 19:49:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169699337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:27,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:27,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735876814] [2025-03-03 19:49:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:27,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:27,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:27,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:27,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:27,898 INFO L87 Difference]: Start difference. First operand 1374 states and 2200 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:28,011 INFO L93 Difference]: Finished difference Result 2593 states and 4141 transitions. [2025-03-03 19:49:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:28,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 457 [2025-03-03 19:49:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:28,020 INFO L225 Difference]: With dead ends: 2593 [2025-03-03 19:49:28,021 INFO L226 Difference]: Without dead ends: 1222 [2025-03-03 19:49:28,024 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-03 19:49:28,025 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:28,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 698 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-03-03 19:49:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2025-03-03 19:49:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 937 states have (on average 1.4770544290288155) internal successors, (1384), 943 states have internal predecessors, (1384), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-03 19:49:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1936 transitions. [2025-03-03 19:49:28,115 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1936 transitions. Word has length 457 [2025-03-03 19:49:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:28,116 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1936 transitions. [2025-03-03 19:49:28,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1936 transitions. [2025-03-03 19:49:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-03 19:49:28,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:28,121 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:28,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:49:28,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:28,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:28,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1730495899, now seen corresponding path program 1 times [2025-03-03 19:49:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106200013] [2025-03-03 19:49:28,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:28,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-03 19:49:28,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-03 19:49:28,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:28,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106200013] [2025-03-03 19:49:28,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106200013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:28,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:28,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967628477] [2025-03-03 19:49:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:28,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:28,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:28,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:28,412 INFO L87 Difference]: Start difference. First operand 1222 states and 1936 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:28,486 INFO L93 Difference]: Finished difference Result 2441 states and 3869 transitions. [2025-03-03 19:49:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 458 [2025-03-03 19:49:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:28,509 INFO L225 Difference]: With dead ends: 2441 [2025-03-03 19:49:28,510 INFO L226 Difference]: Without dead ends: 1222 [2025-03-03 19:49:28,512 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-03 19:49:28,513 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:28,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 348 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-03-03 19:49:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2025-03-03 19:49:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 937 states have (on average 1.4749199573105656) internal successors, (1382), 943 states have internal predecessors, (1382), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 270 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-03 19:49:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1934 transitions. [2025-03-03 19:49:28,587 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1934 transitions. Word has length 458 [2025-03-03 19:49:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:28,587 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1934 transitions. [2025-03-03 19:49:28,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1934 transitions. [2025-03-03 19:49:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-03 19:49:28,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:28,591 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:28,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:49:28,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:28,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2023959484, now seen corresponding path program 1 times [2025-03-03 19:49:28,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573445131] [2025-03-03 19:49:28,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:28,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-03 19:49:28,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 19:49:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:28,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573445131] [2025-03-03 19:49:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573445131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:49:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274895419] [2025-03-03 19:49:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:29,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:49:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:29,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:49:29,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:49:29,522 INFO L87 Difference]: Start difference. First operand 1222 states and 1934 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:30,419 INFO L93 Difference]: Finished difference Result 4147 states and 6632 transitions. [2025-03-03 19:49:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:49:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 460 [2025-03-03 19:49:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:30,442 INFO L225 Difference]: With dead ends: 4147 [2025-03-03 19:49:30,443 INFO L226 Difference]: Without dead ends: 2928 [2025-03-03 19:49:30,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:30,454 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 884 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:30,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2761 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:49:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-03 19:49:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1358. [2025-03-03 19:49:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1001 states have (on average 1.4445554445554445) internal successors, (1446), 1008 states have internal predecessors, (1446), 346 states have call successors, (346), 10 states have call predecessors, (346), 10 states have return successors, (346), 339 states have call predecessors, (346), 346 states have call successors, (346) [2025-03-03 19:49:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2138 transitions. [2025-03-03 19:49:30,649 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2138 transitions. Word has length 460 [2025-03-03 19:49:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 2138 transitions. [2025-03-03 19:49:30,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2138 transitions. [2025-03-03 19:49:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-03 19:49:30,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:30,653 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:30,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:49:30,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash -340257988, now seen corresponding path program 1 times [2025-03-03 19:49:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:30,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084971951] [2025-03-03 19:49:30,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-03 19:49:30,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-03 19:49:30,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:30,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:32,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084971951] [2025-03-03 19:49:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084971951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:49:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501336847] [2025-03-03 19:49:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:49:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:32,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:49:32,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:32,475 INFO L87 Difference]: Start difference. First operand 1358 states and 2138 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-03 19:49:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:34,414 INFO L93 Difference]: Finished difference Result 4580 states and 7100 transitions. [2025-03-03 19:49:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:49:34,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 461 [2025-03-03 19:49:34,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:34,430 INFO L225 Difference]: With dead ends: 4580 [2025-03-03 19:49:34,430 INFO L226 Difference]: Without dead ends: 3345 [2025-03-03 19:49:34,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:49:34,435 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1283 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:34,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1080 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 19:49:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2025-03-03 19:49:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 3070. [2025-03-03 19:49:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2173 states have (on average 1.3612517257248045) internal successors, (2958), 2196 states have internal predecessors, (2958), 862 states have call successors, (862), 34 states have call predecessors, (862), 34 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-03 19:49:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4682 transitions. [2025-03-03 19:49:34,781 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4682 transitions. Word has length 461 [2025-03-03 19:49:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:34,782 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 4682 transitions. [2025-03-03 19:49:34,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-03 19:49:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4682 transitions. [2025-03-03 19:49:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-03 19:49:34,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:34,787 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:34,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:49:34,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:34,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash 621356029, now seen corresponding path program 1 times [2025-03-03 19:49:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:34,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21467654] [2025-03-03 19:49:34,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:34,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-03 19:49:34,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-03 19:49:34,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:34,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:35,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:35,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21467654] [2025-03-03 19:49:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21467654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:35,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:35,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:49:35,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781963664] [2025-03-03 19:49:35,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:35,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:49:35,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:35,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:49:35,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:35,713 INFO L87 Difference]: Start difference. First operand 3070 states and 4682 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-03 19:49:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:36,644 INFO L93 Difference]: Finished difference Result 6233 states and 9352 transitions. [2025-03-03 19:49:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:49:36,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 461 [2025-03-03 19:49:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:36,663 INFO L225 Difference]: With dead ends: 6233 [2025-03-03 19:49:36,663 INFO L226 Difference]: Without dead ends: 3266 [2025-03-03 19:49:36,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:49:36,673 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 484 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:36,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 895 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:49:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2025-03-03 19:49:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2025-03-03 19:49:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 2320 states have (on average 1.3280172413793103) internal successors, (3081), 2343 states have internal predecessors, (3081), 862 states have call successors, (862), 83 states have call predecessors, (862), 83 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-03 19:49:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4805 transitions. [2025-03-03 19:49:37,056 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4805 transitions. Word has length 461 [2025-03-03 19:49:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:37,057 INFO L471 AbstractCegarLoop]: Abstraction has 3266 states and 4805 transitions. [2025-03-03 19:49:37,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-03 19:49:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4805 transitions. [2025-03-03 19:49:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-03 19:49:37,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:37,061 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:37,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:49:37,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:37,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1186098434, now seen corresponding path program 1 times [2025-03-03 19:49:37,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:37,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843925072] [2025-03-03 19:49:37,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:37,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:37,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-03 19:49:37,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-03 19:49:37,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:37,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:37,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:37,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843925072] [2025-03-03 19:49:37,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843925072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:37,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:37,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:49:37,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225660029] [2025-03-03 19:49:37,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:37,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:49:37,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:37,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:49:37,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:49:37,750 INFO L87 Difference]: Start difference. First operand 3266 states and 4805 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:39,234 INFO L93 Difference]: Finished difference Result 9971 states and 14838 transitions. [2025-03-03 19:49:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:49:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 461 [2025-03-03 19:49:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:39,284 INFO L225 Difference]: With dead ends: 9971 [2025-03-03 19:49:39,284 INFO L226 Difference]: Without dead ends: 6812 [2025-03-03 19:49:39,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:49:39,297 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 681 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:39,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 3245 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:49:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2025-03-03 19:49:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 3218. [2025-03-03 19:49:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 2272 states have (on average 1.3243838028169015) internal successors, (3009), 2295 states have internal predecessors, (3009), 862 states have call successors, (862), 83 states have call predecessors, (862), 83 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-03 19:49:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4733 transitions. [2025-03-03 19:49:39,742 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4733 transitions. Word has length 461 [2025-03-03 19:49:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:39,744 INFO L471 AbstractCegarLoop]: Abstraction has 3218 states and 4733 transitions. [2025-03-03 19:49:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4733 transitions. [2025-03-03 19:49:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-03 19:49:39,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:39,749 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:39,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:49:39,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1114824074, now seen corresponding path program 1 times [2025-03-03 19:49:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032607423] [2025-03-03 19:49:39,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:39,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:39,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-03 19:49:39,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-03 19:49:39,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:39,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:40,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032607423] [2025-03-03 19:49:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032607423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:49:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970264384] [2025-03-03 19:49:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:49:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:40,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:49:40,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:40,141 INFO L87 Difference]: Start difference. First operand 3218 states and 4733 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:41,107 INFO L93 Difference]: Finished difference Result 8378 states and 12286 transitions. [2025-03-03 19:49:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:41,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 464 [2025-03-03 19:49:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:41,131 INFO L225 Difference]: With dead ends: 8378 [2025-03-03 19:49:41,131 INFO L226 Difference]: Without dead ends: 5267 [2025-03-03 19:49:41,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03 19:49:41,141 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 690 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:41,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1244 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:49:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2025-03-03 19:49:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 3384. [2025-03-03 19:49:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 2438 states have (on average 1.3457752255947497) internal successors, (3281), 2461 states have internal predecessors, (3281), 862 states have call successors, (862), 83 states have call predecessors, (862), 83 states have return successors, (862), 839 states have call predecessors, (862), 862 states have call successors, (862) [2025-03-03 19:49:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 5005 transitions. [2025-03-03 19:49:41,771 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 5005 transitions. Word has length 464 [2025-03-03 19:49:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:41,772 INFO L471 AbstractCegarLoop]: Abstraction has 3384 states and 5005 transitions. [2025-03-03 19:49:41,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 5005 transitions. [2025-03-03 19:49:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-03 19:49:41,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:41,776 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:41,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:49:41,777 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:41,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1208026773, now seen corresponding path program 1 times [2025-03-03 19:49:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:41,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187845974] [2025-03-03 19:49:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:41,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-03 19:49:41,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-03 19:49:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187845974] [2025-03-03 19:49:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187845974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:41,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:49:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026802946] [2025-03-03 19:49:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:41,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:49:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:41,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:49:41,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:49:41,887 INFO L87 Difference]: Start difference. First operand 3384 states and 5005 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:42,324 INFO L93 Difference]: Finished difference Result 6758 states and 9960 transitions. [2025-03-03 19:49:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:49:42,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 465 [2025-03-03 19:49:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:42,340 INFO L225 Difference]: With dead ends: 6758 [2025-03-03 19:49:42,342 INFO L226 Difference]: Without dead ends: 3481 [2025-03-03 19:49:42,348 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-03 19:49:42,349 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 191 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:42,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 836 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:49:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2025-03-03 19:49:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 2453. [2025-03-03 19:49:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 1795 states have (on average 1.3832869080779944) internal successors, (2483), 1806 states have internal predecessors, (2483), 598 states have call successors, (598), 59 states have call predecessors, (598), 59 states have return successors, (598), 587 states have call predecessors, (598), 598 states have call successors, (598) [2025-03-03 19:49:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3679 transitions. [2025-03-03 19:49:42,634 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3679 transitions. Word has length 465 [2025-03-03 19:49:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:42,634 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3679 transitions. [2025-03-03 19:49:42,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3679 transitions. [2025-03-03 19:49:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-03 19:49:42,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:42,638 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:42,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:49:42,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1826770989, now seen corresponding path program 1 times [2025-03-03 19:49:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:42,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782416573] [2025-03-03 19:49:42,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:42,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:42,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-03 19:49:42,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-03 19:49:42,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:42,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:42,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782416573] [2025-03-03 19:49:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782416573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:42,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:42,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:49:42,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003748825] [2025-03-03 19:49:42,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:42,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:49:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:42,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:49:42,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:42,944 INFO L87 Difference]: Start difference. First operand 2453 states and 3679 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:44,059 INFO L93 Difference]: Finished difference Result 6649 states and 9837 transitions. [2025-03-03 19:49:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 465 [2025-03-03 19:49:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:44,073 INFO L225 Difference]: With dead ends: 6649 [2025-03-03 19:49:44,073 INFO L226 Difference]: Without dead ends: 4303 [2025-03-03 19:49:44,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:44,077 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 872 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:44,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1791 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:49:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2025-03-03 19:49:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 2393. [2025-03-03 19:49:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 1735 states have (on average 1.3706051873198848) internal successors, (2378), 1746 states have internal predecessors, (2378), 598 states have call successors, (598), 59 states have call predecessors, (598), 59 states have return successors, (598), 587 states have call predecessors, (598), 598 states have call successors, (598) [2025-03-03 19:49:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3574 transitions. [2025-03-03 19:49:44,378 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3574 transitions. Word has length 465 [2025-03-03 19:49:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:44,378 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3574 transitions. [2025-03-03 19:49:44,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3574 transitions. [2025-03-03 19:49:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-03 19:49:44,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:44,383 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 19:49:44,384 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash -966653324, now seen corresponding path program 1 times [2025-03-03 19:49:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278774023] [2025-03-03 19:49:44,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:44,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:44,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-03 19:49:44,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-03 19:49:44,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:44,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:49:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278774023] [2025-03-03 19:49:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278774023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:49:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:49:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:49:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92822218] [2025-03-03 19:49:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:49:44,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:49:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:49:44,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:49:44,678 INFO L87 Difference]: Start difference. First operand 2393 states and 3574 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:45,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:45,590 INFO L93 Difference]: Finished difference Result 8293 states and 12265 transitions. [2025-03-03 19:49:45,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:49:45,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 465 [2025-03-03 19:49:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:45,608 INFO L225 Difference]: With dead ends: 8293 [2025-03-03 19:49:45,608 INFO L226 Difference]: Without dead ends: 6007 [2025-03-03 19:49:45,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:49:45,614 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 449 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:45,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1119 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:49:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2025-03-03 19:49:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 5985. [2025-03-03 19:49:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5985 states, 4660 states have (on average 1.392274678111588) internal successors, (6488), 4695 states have internal predecessors, (6488), 1168 states have call successors, (1168), 156 states have call predecessors, (1168), 156 states have return successors, (1168), 1133 states have call predecessors, (1168), 1168 states have call successors, (1168) [2025-03-03 19:49:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5985 states to 5985 states and 8824 transitions. [2025-03-03 19:49:46,435 INFO L78 Accepts]: Start accepts. Automaton has 5985 states and 8824 transitions. Word has length 465 [2025-03-03 19:49:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:46,436 INFO L471 AbstractCegarLoop]: Abstraction has 5985 states and 8824 transitions. [2025-03-03 19:49:46,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:49:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5985 states and 8824 transitions. [2025-03-03 19:49:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-03 19:49:46,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:46,443 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:46,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 19:49:46,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash -686303435, now seen corresponding path program 1 times [2025-03-03 19:49:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967270775] [2025-03-03 19:49:46,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:46,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-03 19:49:46,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-03 19:49:46,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:46,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 126 proven. 81 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-03 19:49:46,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967270775] [2025-03-03 19:49:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967270775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154990986] [2025-03-03 19:49:46,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:46,721 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-03 19:49:46,722 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-03 19:49:46,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-03 19:49:46,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-03 19:49:46,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:46,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:46,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:49:46,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4169 proven. 12 refuted. 0 times theorem prover too weak. 5479 trivial. 0 not checked. [2025-03-03 19:49:48,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:49:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 195 proven. 12 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-03 19:49:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154990986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:49:51,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:49:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 18 [2025-03-03 19:49:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715599441] [2025-03-03 19:49:51,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:49:51,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 19:49:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:51,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 19:49:51,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:49:51,608 INFO L87 Difference]: Start difference. First operand 5985 states and 8824 transitions. Second operand has 18 states, 18 states have (on average 15.277777777777779) internal successors, (275), 18 states have internal predecessors, (275), 8 states have call successors, (167), 5 states have call predecessors, (167), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-03-03 19:49:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:54,459 INFO L93 Difference]: Finished difference Result 11206 states and 16647 transitions. [2025-03-03 19:49:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 19:49:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.277777777777779) internal successors, (275), 18 states have internal predecessors, (275), 8 states have call successors, (167), 5 states have call predecessors, (167), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) Word has length 465 [2025-03-03 19:49:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:54,475 INFO L225 Difference]: With dead ends: 11206 [2025-03-03 19:49:54,475 INFO L226 Difference]: Without dead ends: 5332 [2025-03-03 19:49:54,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 926 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=814, Invalid=2048, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 19:49:54,502 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 1828 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 1242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1242 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:54,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1829 Valid, 1332 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1242 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 19:49:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2025-03-03 19:49:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 2970. [2025-03-03 19:49:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2970 states, 2464 states have (on average 1.4618506493506493) internal successors, (3602), 2475 states have internal predecessors, (3602), 443 states have call successors, (443), 62 states have call predecessors, (443), 62 states have return successors, (443), 432 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-03 19:49:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 4488 transitions. [2025-03-03 19:49:54,855 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 4488 transitions. Word has length 465 [2025-03-03 19:49:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:54,856 INFO L471 AbstractCegarLoop]: Abstraction has 2970 states and 4488 transitions. [2025-03-03 19:49:54,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.277777777777779) internal successors, (275), 18 states have internal predecessors, (275), 8 states have call successors, (167), 5 states have call predecessors, (167), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-03-03 19:49:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 4488 transitions. [2025-03-03 19:49:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 19:49:54,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:54,861 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:54,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:49:55,061 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,SelfDestructingSolverStorable15 [2025-03-03 19:49:55,062 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:55,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash 771782343, now seen corresponding path program 1 times [2025-03-03 19:49:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:55,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050126193] [2025-03-03 19:49:55,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:55,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:49:55,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:49:55,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:55,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 18 proven. 189 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-03 19:49:55,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050126193] [2025-03-03 19:49:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050126193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:55,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654597609] [2025-03-03 19:49:55,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:55,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:55,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:55,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:55,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:49:55,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 19:49:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 19:49:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:55,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:49:55,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 1593 proven. 189 refuted. 0 times theorem prover too weak. 7878 trivial. 0 not checked. [2025-03-03 19:49:56,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:49:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 18 proven. 189 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-03 19:49:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654597609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:49:56,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:49:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 19:49:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127306064] [2025-03-03 19:49:56,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:49:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:49:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:56,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:49:56,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:49:56,914 INFO L87 Difference]: Start difference. First operand 2970 states and 4488 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-03 19:49:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:49:57,591 INFO L93 Difference]: Finished difference Result 5945 states and 8909 transitions. [2025-03-03 19:49:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:49:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) Word has length 466 [2025-03-03 19:49:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:49:57,600 INFO L225 Difference]: With dead ends: 5945 [2025-03-03 19:49:57,600 INFO L226 Difference]: Without dead ends: 3106 [2025-03-03 19:49:57,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 928 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:49:57,604 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 745 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:49:57,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 699 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:49:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-03 19:49:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3022. [2025-03-03 19:49:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2503 states have (on average 1.4498601677986416) internal successors, (3629), 2514 states have internal predecessors, (3629), 443 states have call successors, (443), 75 states have call predecessors, (443), 75 states have return successors, (443), 432 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-03 19:49:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4515 transitions. [2025-03-03 19:49:57,947 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4515 transitions. Word has length 466 [2025-03-03 19:49:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:49:57,947 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 4515 transitions. [2025-03-03 19:49:57,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-03 19:49:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4515 transitions. [2025-03-03 19:49:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-03 19:49:57,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:49:57,951 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:49:57,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 19:49:58,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:58,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:49:58,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:49:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash -442981656, now seen corresponding path program 1 times [2025-03-03 19:49:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:49:58,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955288023] [2025-03-03 19:49:58,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:58,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:49:58,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-03 19:49:58,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-03 19:49:58,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:58,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:49:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615998307] [2025-03-03 19:49:58,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:49:58,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:49:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:49:58,321 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:49:58,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 19:49:58,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-03 19:49:58,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-03 19:49:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:49:58,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:49:58,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 19:49:58,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:49:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 5805 proven. 186 refuted. 0 times theorem prover too weak. 3669 trivial. 0 not checked. [2025-03-03 19:49:59,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:49:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:49:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955288023] [2025-03-03 19:49:59,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:49:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615998307] [2025-03-03 19:49:59,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615998307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:49:59,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:49:59,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 19:49:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785031706] [2025-03-03 19:49:59,251 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 19:49:59,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:49:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:49:59,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:49:59,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:49:59,252 INFO L87 Difference]: Start difference. First operand 3022 states and 4515 transitions. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 3 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-03 19:50:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:00,160 INFO L93 Difference]: Finished difference Result 6043 states and 8960 transitions. [2025-03-03 19:50:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:50:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 3 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 467 [2025-03-03 19:50:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:00,170 INFO L225 Difference]: With dead ends: 6043 [2025-03-03 19:50:00,170 INFO L226 Difference]: Without dead ends: 3156 [2025-03-03 19:50:00,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:50:00,173 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 206 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:00,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 835 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:50:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2025-03-03 19:50:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3066. [2025-03-03 19:50:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2536 states have (on average 1.428627760252366) internal successors, (3623), 2547 states have internal predecessors, (3623), 443 states have call successors, (443), 86 states have call predecessors, (443), 86 states have return successors, (443), 432 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-03 19:50:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4509 transitions. [2025-03-03 19:50:00,509 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4509 transitions. Word has length 467 [2025-03-03 19:50:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 4509 transitions. [2025-03-03 19:50:00,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 3 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-03 19:50:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4509 transitions. [2025-03-03 19:50:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-03 19:50:00,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:00,513 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:50:00,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 19:50:00,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 19:50:00,715 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -683521785, now seen corresponding path program 1 times [2025-03-03 19:50:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:50:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057890141] [2025-03-03 19:50:00,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:50:00,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-03 19:50:00,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-03 19:50:00,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:00,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:50:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870193838] [2025-03-03 19:50:00,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:00,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:50:00,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:50:00,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:50:00,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 19:50:00,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-03 19:50:01,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-03 19:50:01,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:01,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:01,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 19:50:01,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:50:12,966 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-03 19:50:12,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-03-03 19:50:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:50:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057890141] [2025-03-03 19:50:12,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:50:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870193838] [2025-03-03 19:50:12,966 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-03 19:50:12,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 19:50:13,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:50:13,169 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:947) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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) ... 44 more [2025-03-03 19:50:13,172 INFO L158 Benchmark]: Toolchain (without parser) took 50840.46ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 106.8MB in the beginning and 384.4MB in the end (delta: -277.6MB). Peak memory consumption was 460.0MB. Max. memory is 16.1GB. [2025-03-03 19:50:13,172 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:50:13,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.47ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 83.5MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:50:13,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.75ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 74.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:50:13,172 INFO L158 Benchmark]: Boogie Preprocessor took 105.64ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 66.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:50:13,172 INFO L158 Benchmark]: IcfgBuilder took 956.77ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 61.2MB in the end (delta: 4.2MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2025-03-03 19:50:13,173 INFO L158 Benchmark]: TraceAbstraction took 49255.63ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 60.6MB in the beginning and 384.4MB in the end (delta: -323.8MB). Peak memory consumption was 417.4MB. Max. memory is 16.1GB. [2025-03-03 19:50:13,173 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.47ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 83.5MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.75ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 74.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.64ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 66.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 956.77ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 61.2MB in the end (delta: 4.2MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49255.63ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 60.6MB in the beginning and 384.4MB in the end (delta: -323.8MB). Peak memory consumption was 417.4MB. 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-65.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 31da68eea262c34083df1fad46a5753e80d18ad2f5e3cbbafbfb2efef5c55c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:50:14,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:50:14,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:50:14,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:50:14,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:50:14,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:50:14,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:50:14,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:50:14,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:50:14,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:50:14,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:50:14,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:50:14,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:50:14,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:50:14,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:50:14,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:50:14,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:50:14,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:50:14,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:50:14,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:50:14,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:50:14,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:50:14,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:50:14,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:50:14,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:50:14,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:50:14,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:50:14,854 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 -> 31da68eea262c34083df1fad46a5753e80d18ad2f5e3cbbafbfb2efef5c55c33 [2025-03-03 19:50:15,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:50:15,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:50:15,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:50:15,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:50:15,095 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:50:15,097 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-65.i [2025-03-03 19:50:16,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d91c1c19/ec5a9f6ecc1a4ba381c90877b42e3205/FLAGbde63affd [2025-03-03 19:50:16,430 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:50:16,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i [2025-03-03 19:50:16,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d91c1c19/ec5a9f6ecc1a4ba381c90877b42e3205/FLAGbde63affd [2025-03-03 19:50:16,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d91c1c19/ec5a9f6ecc1a4ba381c90877b42e3205 [2025-03-03 19:50:16,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:50:16,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:50:16,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:50:16,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:50:16,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:50:16,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5843a6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16, skipping insertion in model container [2025-03-03 19:50:16,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:50:16,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-65.i[916,929] [2025-03-03 19:50:16,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:50:16,722 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:50:16,730 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-65.i[916,929] [2025-03-03 19:50:16,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:50:16,801 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:50:16,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16 WrapperNode [2025-03-03 19:50:16,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:50:16,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:50:16,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:50:16,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:50:16,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,841 INFO L138 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2025-03-03 19:50:16,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:50:16,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:50:16,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:50:16,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:50:16,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,870 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-03 19:50:16,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:50:16,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:50:16,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:50:16,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:50:16,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (1/1) ... [2025-03-03 19:50:16,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:50:16,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:50:16,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:50:16,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:50:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:50:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:50:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:50:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:50:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:50:16,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:50:17,067 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:50:17,069 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:50:26,582 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 19:50:26,583 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:50:26,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:50:26,591 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:50:26,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:50:26 BoogieIcfgContainer [2025-03-03 19:50:26,591 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:50:26,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:50:26,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:50:26,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:50:26,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:50:16" (1/3) ... [2025-03-03 19:50:26,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceb9ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:50:26, skipping insertion in model container [2025-03-03 19:50:26,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:50:16" (2/3) ... [2025-03-03 19:50:26,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceb9ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:50:26, skipping insertion in model container [2025-03-03 19:50:26,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:50:26" (3/3) ... [2025-03-03 19:50:26,602 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-65.i [2025-03-03 19:50:26,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:50:26,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-65.i that has 2 procedures, 191 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:50:26,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:50:26,660 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;@53e52880, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:50:26,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:50:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 118 states have (on average 1.5169491525423728) internal successors, (179), 119 states have internal predecessors, (179), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:50:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-03 19:50:26,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:26,681 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:50:26,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:26,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 718559401, now seen corresponding path program 1 times [2025-03-03 19:50:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:50:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037044272] [2025-03-03 19:50:26,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:26,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:50:26,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:50:26,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:50:26,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:50:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 19:50:27,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 19:50:27,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:27,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:27,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:50:27,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:50:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4370 proven. 0 refuted. 0 times theorem prover too weak. 5290 trivial. 0 not checked. [2025-03-03 19:50:27,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:50:27,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:50:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037044272] [2025-03-03 19:50:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037044272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:50:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780026116] [2025-03-03 19:50:27,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:27,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:50:27,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:50:27,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:50:27,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:50:27,805 INFO L87 Difference]: Start difference. First operand has 191 states, 118 states have (on average 1.5169491525423728) internal successors, (179), 119 states have internal predecessors, (179), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-03 19:50:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:27,843 INFO L93 Difference]: Finished difference Result 376 states and 703 transitions. [2025-03-03 19:50:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:50:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 442 [2025-03-03 19:50:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:27,851 INFO L225 Difference]: With dead ends: 376 [2025-03-03 19:50:27,851 INFO L226 Difference]: Without dead ends: 188 [2025-03-03 19:50:27,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:50:27,857 INFO L435 NwaCegarLoop]: 312 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, 312 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:27,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:50:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-03 19:50:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-03 19:50:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 116 states have (on average 1.4827586206896552) internal successors, (172), 116 states have internal predecessors, (172), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:50:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 312 transitions. [2025-03-03 19:50:27,912 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 312 transitions. Word has length 442 [2025-03-03 19:50:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:27,912 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 312 transitions. [2025-03-03 19:50:27,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-03 19:50:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 312 transitions. [2025-03-03 19:50:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-03 19:50:27,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:27,923 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:50:27,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 19:50:28,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:50:28,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:28,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -127313010, now seen corresponding path program 1 times [2025-03-03 19:50:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:50:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105216335] [2025-03-03 19:50:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:28,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:50:28,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:50:28,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:50:28,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:50:28,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 19:50:29,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 19:50:29,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:29,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:29,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:50:29,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:50:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4437 proven. 135 refuted. 0 times theorem prover too weak. 5088 trivial. 0 not checked. [2025-03-03 19:50:30,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:50:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 72 proven. 135 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2025-03-03 19:50:31,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:50:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105216335] [2025-03-03 19:50:31,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105216335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:50:31,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:50:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 19:50:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433763085] [2025-03-03 19:50:31,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:50:31,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:50:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:50:31,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:50:31,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:50:31,372 INFO L87 Difference]: Start difference. First operand 188 states and 312 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-03-03 19:50:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:33,391 INFO L93 Difference]: Finished difference Result 377 states and 622 transitions. [2025-03-03 19:50:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:50:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) Word has length 442 [2025-03-03 19:50:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:33,398 INFO L225 Difference]: With dead ends: 377 [2025-03-03 19:50:33,398 INFO L226 Difference]: Without dead ends: 192 [2025-03-03 19:50:33,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 876 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:50:33,399 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 265 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:33,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 518 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 19:50:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-03 19:50:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2025-03-03 19:50:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 19:50:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 304 transitions. [2025-03-03 19:50:33,431 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 304 transitions. Word has length 442 [2025-03-03 19:50:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:33,434 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 304 transitions. [2025-03-03 19:50:33,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-03-03 19:50:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 304 transitions. [2025-03-03 19:50:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-03 19:50:33,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:33,438 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:50:33,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:50:33,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:50:33,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:33,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash -141393716, now seen corresponding path program 1 times [2025-03-03 19:50:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:50:33,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126530034] [2025-03-03 19:50:33,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:33,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:50:33,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:50:33,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:50:33,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:50:33,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-03 19:50:34,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-03 19:50:34,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:34,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:34,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:50:34,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:50:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-03 19:50:34,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:50:34,625 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:50:34,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126530034] [2025-03-03 19:50:34,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126530034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:50:34,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:50:34,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:50:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529182990] [2025-03-03 19:50:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:50:34,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:50:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:50:34,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:50:34,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:50:34,627 INFO L87 Difference]: Start difference. First operand 190 states and 304 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:50:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:50:34,711 INFO L93 Difference]: Finished difference Result 478 states and 769 transitions. [2025-03-03 19:50:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:50:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 443 [2025-03-03 19:50:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:50:34,714 INFO L225 Difference]: With dead ends: 478 [2025-03-03 19:50:34,714 INFO L226 Difference]: Without dead ends: 291 [2025-03-03 19:50:34,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 441 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-03 19:50:34,719 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 147 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:50:34,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 678 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:50:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-03 19:50:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2025-03-03 19:50:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 192 states have (on average 1.4427083333333333) internal successors, (277), 193 states have internal predecessors, (277), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 19:50:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 461 transitions. [2025-03-03 19:50:34,744 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 461 transitions. Word has length 443 [2025-03-03 19:50:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:50:34,744 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 461 transitions. [2025-03-03 19:50:34,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-03 19:50:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 461 transitions. [2025-03-03 19:50:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-03 19:50:34,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:50:34,747 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:50:34,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:50:34,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:50:34,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:50:34,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:50:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash 411396076, now seen corresponding path program 1 times [2025-03-03 19:50:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:50:34,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345069021] [2025-03-03 19:50:34,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:50:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:50:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:50:34,951 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:50:34,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:50:35,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-03 19:50:35,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-03 19:50:35,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:50:35,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:50:35,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:50:35,875 INFO L279 TraceCheckSpWp]: Computing forward predicates...