./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-73.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-500_file-73.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 ff8b1e3c8fca84bf7aa4f961205f2b6eea68a0ab1a2694b5097394cdb3b9c760 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:47,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:47,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:47,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:47,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:47,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:47,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:47,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:47,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:47,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:47,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:47,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:47,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:47,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:47,203 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:47,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:47,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:47,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:47,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:47,205 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:47,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:47,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:47,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:47,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:47,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:47,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:47,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:47,206 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 -> ff8b1e3c8fca84bf7aa4f961205f2b6eea68a0ab1a2694b5097394cdb3b9c760 [2025-03-03 20:10:47,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:47,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:47,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:47,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:47,465 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:47,466 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-500_file-73.i [2025-03-03 20:10:48,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c7436f9/16afe016178242dc813a7a4dd6962e1a/FLAG282e72697 [2025-03-03 20:10:48,912 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:48,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-73.i [2025-03-03 20:10:48,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c7436f9/16afe016178242dc813a7a4dd6962e1a/FLAG282e72697 [2025-03-03 20:10:49,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c7436f9/16afe016178242dc813a7a4dd6962e1a [2025-03-03 20:10:49,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:49,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:49,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:49,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:49,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:49,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244c8d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49, skipping insertion in model container [2025-03-03 20:10:49,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:49,313 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-500_file-73.i[916,929] [2025-03-03 20:10:49,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:49,466 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:49,475 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-500_file-73.i[916,929] [2025-03-03 20:10:49,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:49,565 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:49,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49 WrapperNode [2025-03-03 20:10:49,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:49,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:49,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:49,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:49,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,648 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 779 [2025-03-03 20:10:49,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:49,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:49,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:49,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:49,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,705 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 20:10:49,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:49,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:49,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:49,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:49,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (1/1) ... [2025-03-03 20:10:49,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:49,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:49,800 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 20:10:49,805 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 20:10:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:49,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:49,943 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:50,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: havoc property_#t~bitwise66#1;havoc property_#t~short67#1; [2025-03-03 20:10:50,867 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:50,867 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:50,903 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:50,904 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:10:50,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:50 BoogieIcfgContainer [2025-03-03 20:10:50,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:50,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:50,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:50,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:50,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:49" (1/3) ... [2025-03-03 20:10:50,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cca7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:50, skipping insertion in model container [2025-03-03 20:10:50,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:49" (2/3) ... [2025-03-03 20:10:50,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cca7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:50, skipping insertion in model container [2025-03-03 20:10:50,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:50" (3/3) ... [2025-03-03 20:10:50,913 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-73.i [2025-03-03 20:10:50,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:50,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-73.i that has 2 procedures, 316 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:51,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:51,017 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;@5db52ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:51,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 316 states, 232 states have (on average 1.6120689655172413) internal successors, (374), 233 states have internal predecessors, (374), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:10:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 20:10:51,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:51,048 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:51,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:51,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1750958909, now seen corresponding path program 1 times [2025-03-03 20:10:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804892897] [2025-03-03 20:10:51,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:51,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:51,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:51,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:51,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-03 20:10:51,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804892897] [2025-03-03 20:10:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804892897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:51,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069844903] [2025-03-03 20:10:51,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:51,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:51,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:51,571 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 20:10:51,573 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 20:10:51,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:51,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:51,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:51,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:51,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:51,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-03 20:10:51,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:51,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069844903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:51,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:51,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744984174] [2025-03-03 20:10:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:52,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:52,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:52,022 INFO L87 Difference]: Start difference. First operand has 316 states, 232 states have (on average 1.6120689655172413) internal successors, (374), 233 states have internal predecessors, (374), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 20:10:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:52,115 INFO L93 Difference]: Finished difference Result 626 states and 1148 transitions. [2025-03-03 20:10:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:52,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) Word has length 553 [2025-03-03 20:10:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:52,129 INFO L225 Difference]: With dead ends: 626 [2025-03-03 20:10:52,129 INFO L226 Difference]: Without dead ends: 313 [2025-03-03 20:10:52,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 554 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 20:10:52,139 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:52,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-03 20:10:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-03 20:10:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 230 states have (on average 1.6043478260869566) internal successors, (369), 230 states have internal predecessors, (369), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:10:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 531 transitions. [2025-03-03 20:10:52,210 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 531 transitions. Word has length 553 [2025-03-03 20:10:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:52,211 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 531 transitions. [2025-03-03 20:10:52,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 20:10:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 531 transitions. [2025-03-03 20:10:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 20:10:52,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:52,223 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:52,233 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 20:10:52,424 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 20:10:52,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:52,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1194965884, now seen corresponding path program 1 times [2025-03-03 20:10:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:52,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905148829] [2025-03-03 20:10:52,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:52,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:52,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:52,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:52,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:10:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905148829] [2025-03-03 20:10:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905148829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074653028] [2025-03-03 20:10:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:52,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:52,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:52,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:52,906 INFO L87 Difference]: Start difference. First operand 313 states and 531 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:53,028 INFO L93 Difference]: Finished difference Result 835 states and 1423 transitions. [2025-03-03 20:10:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:53,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 553 [2025-03-03 20:10:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:53,036 INFO L225 Difference]: With dead ends: 835 [2025-03-03 20:10:53,038 INFO L226 Difference]: Without dead ends: 525 [2025-03-03 20:10:53,039 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 20:10:53,040 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 372 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:53,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1225 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-03 20:10:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 522. [2025-03-03 20:10:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 398 states have (on average 1.6180904522613064) internal successors, (644), 399 states have internal predecessors, (644), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-03 20:10:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 886 transitions. [2025-03-03 20:10:53,116 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 886 transitions. Word has length 553 [2025-03-03 20:10:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:53,118 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 886 transitions. [2025-03-03 20:10:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 886 transitions. [2025-03-03 20:10:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 20:10:53,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:53,125 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:53,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:53,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:53,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1892083237, now seen corresponding path program 1 times [2025-03-03 20:10:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:53,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958651294] [2025-03-03 20:10:53,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:53,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:53,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:53,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 20:10:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:53,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958651294] [2025-03-03 20:10:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958651294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501432253] [2025-03-03 20:10:53,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:53,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:53,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:53,985 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 20:10:53,987 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 20:10:54,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:54,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:54,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:54,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:54,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 20:10:54,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:10:55,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501432253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-03 20:10:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543779004] [2025-03-03 20:10:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:55,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:55,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:55,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:55,851 INFO L87 Difference]: Start difference. First operand 522 states and 886 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:55,981 INFO L93 Difference]: Finished difference Result 1560 states and 2652 transitions. [2025-03-03 20:10:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 553 [2025-03-03 20:10:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:55,990 INFO L225 Difference]: With dead ends: 1560 [2025-03-03 20:10:55,991 INFO L226 Difference]: Without dead ends: 1041 [2025-03-03 20:10:55,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:55,993 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 266 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:55,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 981 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-03-03 20:10:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1038. [2025-03-03 20:10:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 791 states have (on average 1.618204804045512) internal successors, (1280), 793 states have internal predecessors, (1280), 242 states have call successors, (242), 4 states have call predecessors, (242), 4 states have return successors, (242), 240 states have call predecessors, (242), 242 states have call successors, (242) [2025-03-03 20:10:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1764 transitions. [2025-03-03 20:10:56,100 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1764 transitions. Word has length 553 [2025-03-03 20:10:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:56,101 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1764 transitions. [2025-03-03 20:10:56,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1764 transitions. [2025-03-03 20:10:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 20:10:56,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:56,105 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:56,114 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 20:10:56,306 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,SelfDestructingSolverStorable2 [2025-03-03 20:10:56,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:56,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1122913222, now seen corresponding path program 1 times [2025-03-03 20:10:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:56,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22166309] [2025-03-03 20:10:56,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:56,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:56,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 20:10:56,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22166309] [2025-03-03 20:10:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22166309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:56,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717582886] [2025-03-03 20:10:56,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:56,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:56,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:56,825 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 20:10:56,826 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 20:10:56,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:57,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:57,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:57,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:57,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1335 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:10:57,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:10:57,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717582886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:57,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-03 20:10:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856122709] [2025-03-03 20:10:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:57,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:57,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:57,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:57,622 INFO L87 Difference]: Start difference. First operand 1038 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:57,734 INFO L93 Difference]: Finished difference Result 3108 states and 5286 transitions. [2025-03-03 20:10:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 553 [2025-03-03 20:10:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:57,749 INFO L225 Difference]: With dead ends: 3108 [2025-03-03 20:10:57,749 INFO L226 Difference]: Without dead ends: 2073 [2025-03-03 20:10:57,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:57,755 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 257 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:57,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1004 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2025-03-03 20:10:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 2071. [2025-03-03 20:10:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 1578 states have (on average 1.6159695817490494) internal successors, (2550), 1582 states have internal predecessors, (2550), 484 states have call successors, (484), 8 states have call predecessors, (484), 8 states have return successors, (484), 480 states have call predecessors, (484), 484 states have call successors, (484) [2025-03-03 20:10:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3518 transitions. [2025-03-03 20:10:57,899 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3518 transitions. Word has length 553 [2025-03-03 20:10:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 3518 transitions. [2025-03-03 20:10:57,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3518 transitions. [2025-03-03 20:10:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 20:10:57,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:57,905 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:57,914 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 20:10:58,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:58,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:58,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash -998839975, now seen corresponding path program 1 times [2025-03-03 20:10:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507703103] [2025-03-03 20:10:58,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:58,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:58,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 20:10:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507703103] [2025-03-03 20:10:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507703103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950550351] [2025-03-03 20:10:58,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:58,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:58,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:58,594 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 20:10:58,596 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 20:10:58,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:58,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:58,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:58,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:58,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:10:58,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:10:58,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950550351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:58,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:58,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 20:10:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41691293] [2025-03-03 20:10:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:58,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:58,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:58,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:58,935 INFO L87 Difference]: Start difference. First operand 2071 states and 3518 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:59,058 INFO L93 Difference]: Finished difference Result 5613 states and 9514 transitions. [2025-03-03 20:10:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:59,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 553 [2025-03-03 20:10:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:59,078 INFO L225 Difference]: With dead ends: 5613 [2025-03-03 20:10:59,078 INFO L226 Difference]: Without dead ends: 3545 [2025-03-03 20:10:59,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:59,085 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 300 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:59,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1062 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2025-03-03 20:10:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3539. [2025-03-03 20:10:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 2686 states have (on average 1.601638123603872) internal successors, (4302), 2698 states have internal predecessors, (4302), 836 states have call successors, (836), 16 states have call predecessors, (836), 16 states have return successors, (836), 824 states have call predecessors, (836), 836 states have call successors, (836) [2025-03-03 20:10:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 5974 transitions. [2025-03-03 20:10:59,281 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 5974 transitions. Word has length 553 [2025-03-03 20:10:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:59,282 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 5974 transitions. [2025-03-03 20:10:59,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:10:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 5974 transitions. [2025-03-03 20:10:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 20:10:59,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:59,288 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:59,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 20:10:59,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:59,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:59,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash -987523848, now seen corresponding path program 1 times [2025-03-03 20:10:59,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:59,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390257161] [2025-03-03 20:10:59,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:59,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:59,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:10:59,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:10:59,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:59,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 20:10:59,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390257161] [2025-03-03 20:10:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390257161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:59,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285862190] [2025-03-03 20:10:59,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:59,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:59,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:59,854 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 20:10:59,856 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 20:11:00,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:11:00,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:11:00,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:00,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:00,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:11:00,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:00,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285862190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:00,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 20:11:00,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905908776] [2025-03-03 20:11:00,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:00,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:00,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:00,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:00,160 INFO L87 Difference]: Start difference. First operand 3539 states and 5974 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:00,433 INFO L93 Difference]: Finished difference Result 10595 states and 17884 transitions. [2025-03-03 20:11:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 553 [2025-03-03 20:11:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:00,473 INFO L225 Difference]: With dead ends: 10595 [2025-03-03 20:11:00,473 INFO L226 Difference]: Without dead ends: 7059 [2025-03-03 20:11:00,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:00,488 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 509 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:00,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1096 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7059 states. [2025-03-03 20:11:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7059 to 7057. [2025-03-03 20:11:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7057 states, 5352 states have (on average 1.5919282511210762) internal successors, (8520), 5376 states have internal predecessors, (8520), 1672 states have call successors, (1672), 32 states have call predecessors, (1672), 32 states have return successors, (1672), 1648 states have call predecessors, (1672), 1672 states have call successors, (1672) [2025-03-03 20:11:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 11864 transitions. [2025-03-03 20:11:00,843 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 11864 transitions. Word has length 553 [2025-03-03 20:11:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:00,844 INFO L471 AbstractCegarLoop]: Abstraction has 7057 states and 11864 transitions. [2025-03-03 20:11:00,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 11864 transitions. [2025-03-03 20:11:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-03 20:11:00,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:00,856 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:00,865 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 20:11:01,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:01,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:01,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash -703730664, now seen corresponding path program 1 times [2025-03-03 20:11:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:01,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010755378] [2025-03-03 20:11:01,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:01,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:11:01,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:11:01,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:01,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 20:11:01,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:01,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010755378] [2025-03-03 20:11:01,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010755378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:01,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890547512] [2025-03-03 20:11:01,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:01,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:01,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:01,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:01,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 20:11:01,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-03 20:11:01,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-03 20:11:01,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:01,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:01,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 20:11:01,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:02,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890547512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:02,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:02,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-03 20:11:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704440085] [2025-03-03 20:11:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:02,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:02,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:02,730 INFO L87 Difference]: Start difference. First operand 7057 states and 11864 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:02,975 INFO L93 Difference]: Finished difference Result 15877 states and 26692 transitions. [2025-03-03 20:11:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 553 [2025-03-03 20:11:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:03,043 INFO L225 Difference]: With dead ends: 15877 [2025-03-03 20:11:03,045 INFO L226 Difference]: Without dead ends: 8823 [2025-03-03 20:11:03,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:03,070 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 287 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:03,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1207 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:11:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8823 states. [2025-03-03 20:11:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8823 to 8821. [2025-03-03 20:11:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8821 states, 6690 states have (on average 1.5895366218236173) internal successors, (10634), 6720 states have internal predecessors, (10634), 2090 states have call successors, (2090), 40 states have call predecessors, (2090), 40 states have return successors, (2090), 2060 states have call predecessors, (2090), 2090 states have call successors, (2090) [2025-03-03 20:11:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 14814 transitions. [2025-03-03 20:11:03,649 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 14814 transitions. Word has length 553 [2025-03-03 20:11:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:03,651 INFO L471 AbstractCegarLoop]: Abstraction has 8821 states and 14814 transitions. [2025-03-03 20:11:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 14814 transitions. [2025-03-03 20:11:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-03 20:11:03,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:03,662 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:03,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 20:11:03,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:03,867 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1512255364, now seen corresponding path program 1 times [2025-03-03 20:11:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937157027] [2025-03-03 20:11:03,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:03,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:03,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-03 20:11:03,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-03 20:11:03,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:03,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:04,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:04,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937157027] [2025-03-03 20:11:04,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937157027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:04,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:04,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:11:04,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641646638] [2025-03-03 20:11:04,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:04,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:11:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:04,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:11:04,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:11:04,074 INFO L87 Difference]: Start difference. First operand 8821 states and 14814 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:04,238 INFO L93 Difference]: Finished difference Result 14107 states and 23673 transitions. [2025-03-03 20:11:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:11:04,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 554 [2025-03-03 20:11:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:04,271 INFO L225 Difference]: With dead ends: 14107 [2025-03-03 20:11:04,272 INFO L226 Difference]: Without dead ends: 5289 [2025-03-03 20:11:04,298 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 20:11:04,299 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 382 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:04,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 499 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:11:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5289 states. [2025-03-03 20:11:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5289 to 5289. [2025-03-03 20:11:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5289 states, 4010 states have (on average 1.5830423940149625) internal successors, (6348), 4028 states have internal predecessors, (6348), 1254 states have call successors, (1254), 24 states have call predecessors, (1254), 24 states have return successors, (1254), 1236 states have call predecessors, (1254), 1254 states have call successors, (1254) [2025-03-03 20:11:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5289 states to 5289 states and 8856 transitions. [2025-03-03 20:11:04,612 INFO L78 Accepts]: Start accepts. Automaton has 5289 states and 8856 transitions. Word has length 554 [2025-03-03 20:11:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 5289 states and 8856 transitions. [2025-03-03 20:11:04,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5289 states and 8856 transitions. [2025-03-03 20:11:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-03 20:11:04,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:04,620 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:04,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:11:04,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash -289791197, now seen corresponding path program 1 times [2025-03-03 20:11:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855212674] [2025-03-03 20:11:04,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-03 20:11:04,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-03 20:11:04,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:04,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:05,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:05,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855212674] [2025-03-03 20:11:05,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855212674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:05,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:11:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373826922] [2025-03-03 20:11:05,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:05,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:11:05,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:05,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:11:05,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:05,127 INFO L87 Difference]: Start difference. First operand 5289 states and 8856 transitions. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:06,898 INFO L93 Difference]: Finished difference Result 29707 states and 49717 transitions. [2025-03-03 20:11:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:11:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 555 [2025-03-03 20:11:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:06,989 INFO L225 Difference]: With dead ends: 29707 [2025-03-03 20:11:06,989 INFO L226 Difference]: Without dead ends: 24421 [2025-03-03 20:11:07,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:11:07,024 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 1538 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:07,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 3245 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:11:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24421 states. [2025-03-03 20:11:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24421 to 24353. [2025-03-03 20:11:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24353 states, 18646 states have (on average 1.5863992277164003) internal successors, (29580), 18748 states have internal predecessors, (29580), 5586 states have call successors, (5586), 120 states have call predecessors, (5586), 120 states have return successors, (5586), 5484 states have call predecessors, (5586), 5586 states have call successors, (5586) [2025-03-03 20:11:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24353 states to 24353 states and 40752 transitions. [2025-03-03 20:11:08,281 INFO L78 Accepts]: Start accepts. Automaton has 24353 states and 40752 transitions. Word has length 555 [2025-03-03 20:11:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:08,282 INFO L471 AbstractCegarLoop]: Abstraction has 24353 states and 40752 transitions. [2025-03-03 20:11:08,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24353 states and 40752 transitions. [2025-03-03 20:11:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-03 20:11:08,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:08,301 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:08,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:11:08,302 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:08,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1343012802, now seen corresponding path program 1 times [2025-03-03 20:11:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904512692] [2025-03-03 20:11:08,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:08,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-03 20:11:08,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-03 20:11:08,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 20:11:08,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904512692] [2025-03-03 20:11:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904512692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:08,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414067698] [2025-03-03 20:11:08,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:08,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:08,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 20:11:09,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-03 20:11:09,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-03 20:11:09,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:09,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:09,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:11:09,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:09,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414067698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 20:11:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424519180] [2025-03-03 20:11:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:09,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:09,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:11:09,692 INFO L87 Difference]: Start difference. First operand 24353 states and 40752 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:12,021 INFO L93 Difference]: Finished difference Result 76415 states and 127908 transitions. [2025-03-03 20:11:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 555 [2025-03-03 20:11:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:12,190 INFO L225 Difference]: With dead ends: 76415 [2025-03-03 20:11:12,191 INFO L226 Difference]: Without dead ends: 52065 [2025-03-03 20:11:12,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:11:12,250 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1233 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:12,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1646 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:11:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52065 states. [2025-03-03 20:11:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52065 to 51899. [2025-03-03 20:11:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51899 states, 41312 states have (on average 1.6063129357087529) internal successors, (66360), 41574 states have internal predecessors, (66360), 10306 states have call successors, (10306), 280 states have call predecessors, (10306), 280 states have return successors, (10306), 10044 states have call predecessors, (10306), 10306 states have call successors, (10306) [2025-03-03 20:11:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51899 states to 51899 states and 86972 transitions. [2025-03-03 20:11:14,455 INFO L78 Accepts]: Start accepts. Automaton has 51899 states and 86972 transitions. Word has length 555 [2025-03-03 20:11:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:14,456 INFO L471 AbstractCegarLoop]: Abstraction has 51899 states and 86972 transitions. [2025-03-03 20:11:14,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 51899 states and 86972 transitions. [2025-03-03 20:11:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-03 20:11:14,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:14,502 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:14,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 20:11:14,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:14,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:14,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash 387491523, now seen corresponding path program 1 times [2025-03-03 20:11:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:14,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549454950] [2025-03-03 20:11:14,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:14,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-03 20:11:14,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-03 20:11:14,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:14,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 20:11:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549454950] [2025-03-03 20:11:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549454950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817957092] [2025-03-03 20:11:15,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:15,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:15,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:15,492 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:11:15,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 20:11:15,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-03 20:11:15,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-03 20:11:15,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:15,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:15,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1335 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 20:11:15,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:17,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:11:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817957092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:17,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:11:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-03 20:11:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238488117] [2025-03-03 20:11:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:11:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:17,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:11:17,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:11:17,064 INFO L87 Difference]: Start difference. First operand 51899 states and 86972 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:20,221 INFO L93 Difference]: Finished difference Result 124355 states and 208474 transitions. [2025-03-03 20:11:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:20,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 555 [2025-03-03 20:11:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:20,530 INFO L225 Difference]: With dead ends: 124355 [2025-03-03 20:11:20,530 INFO L226 Difference]: Without dead ends: 72459 [2025-03-03 20:11:20,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:11:20,667 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 2316 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:20,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1955 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:11:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72459 states. [2025-03-03 20:11:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72459 to 37389. [2025-03-03 20:11:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37389 states, 30136 states have (on average 1.610830899920361) internal successors, (48544), 30324 states have internal predecessors, (48544), 7052 states have call successors, (7052), 200 states have call predecessors, (7052), 200 states have return successors, (7052), 6864 states have call predecessors, (7052), 7052 states have call successors, (7052) [2025-03-03 20:11:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37389 states to 37389 states and 62648 transitions. [2025-03-03 20:11:22,897 INFO L78 Accepts]: Start accepts. Automaton has 37389 states and 62648 transitions. Word has length 555 [2025-03-03 20:11:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:22,898 INFO L471 AbstractCegarLoop]: Abstraction has 37389 states and 62648 transitions. [2025-03-03 20:11:22,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 37389 states and 62648 transitions. [2025-03-03 20:11:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-03 20:11:22,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:22,922 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:22,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 20:11:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 20:11:23,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:23,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash 726621298, now seen corresponding path program 1 times [2025-03-03 20:11:23,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:23,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565619917] [2025-03-03 20:11:23,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:23,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-03 20:11:23,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-03 20:11:23,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:23,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:24,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:24,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565619917] [2025-03-03 20:11:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565619917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:24,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:11:24,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529554848] [2025-03-03 20:11:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:24,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:11:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:24,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:11:24,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:11:24,072 INFO L87 Difference]: Start difference. First operand 37389 states and 62648 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:27,245 INFO L93 Difference]: Finished difference Result 101265 states and 169593 transitions. [2025-03-03 20:11:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:11:27,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 556 [2025-03-03 20:11:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:27,450 INFO L225 Difference]: With dead ends: 101265 [2025-03-03 20:11:27,450 INFO L226 Difference]: Without dead ends: 63879 [2025-03-03 20:11:27,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:11:27,526 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1585 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:27,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 3154 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:11:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63879 states. [2025-03-03 20:11:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63879 to 63795. [2025-03-03 20:11:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63795 states, 51544 states have (on average 1.6085674375291013) internal successors, (82912), 51870 states have internal predecessors, (82912), 11906 states have call successors, (11906), 344 states have call predecessors, (11906), 344 states have return successors, (11906), 11580 states have call predecessors, (11906), 11906 states have call successors, (11906) [2025-03-03 20:11:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63795 states to 63795 states and 106724 transitions. [2025-03-03 20:11:30,694 INFO L78 Accepts]: Start accepts. Automaton has 63795 states and 106724 transitions. Word has length 556 [2025-03-03 20:11:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:30,695 INFO L471 AbstractCegarLoop]: Abstraction has 63795 states and 106724 transitions. [2025-03-03 20:11:30,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 63795 states and 106724 transitions. [2025-03-03 20:11:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-03 20:11:30,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:30,743 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:11:30,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1935541999, now seen corresponding path program 1 times [2025-03-03 20:11:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582792363] [2025-03-03 20:11:30,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:30,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-03 20:11:30,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-03 20:11:30,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:30,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582792363] [2025-03-03 20:11:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582792363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563151289] [2025-03-03 20:11:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:31,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:31,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:31,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:31,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:31,401 INFO L87 Difference]: Start difference. First operand 63795 states and 106724 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:40,613 INFO L93 Difference]: Finished difference Result 226459 states and 375380 transitions. [2025-03-03 20:11:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:11:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 556 [2025-03-03 20:11:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:41,415 INFO L225 Difference]: With dead ends: 226459 [2025-03-03 20:11:41,415 INFO L226 Difference]: Without dead ends: 162667 [2025-03-03 20:11:41,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 20:11:41,735 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 959 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:41,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1779 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:11:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162667 states. [2025-03-03 20:11:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162667 to 126617. [2025-03-03 20:11:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126617 states, 102854 states have (on average 1.6044101347541175) internal successors, (165020), 103524 states have internal predecessors, (165020), 23074 states have call successors, (23074), 688 states have call predecessors, (23074), 688 states have return successors, (23074), 22404 states have call predecessors, (23074), 23074 states have call successors, (23074) [2025-03-03 20:11:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126617 states to 126617 states and 211168 transitions. [2025-03-03 20:11:50,120 INFO L78 Accepts]: Start accepts. Automaton has 126617 states and 211168 transitions. Word has length 556 [2025-03-03 20:11:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:50,120 INFO L471 AbstractCegarLoop]: Abstraction has 126617 states and 211168 transitions. [2025-03-03 20:11:50,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 20:11:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 126617 states and 211168 transitions. [2025-03-03 20:11:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-03 20:11:50,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:50,194 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:50,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:11:50,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:50,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 112668466, now seen corresponding path program 1 times [2025-03-03 20:11:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:50,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904147828] [2025-03-03 20:11:50,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:50,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:50,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-03 20:11:50,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-03 20:11:50,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:50,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 20:11:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904147828] [2025-03-03 20:11:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904147828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:11:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378228752] [2025-03-03 20:11:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:11:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:50,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:11:50,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:11:50,988 INFO L87 Difference]: Start difference. First operand 126617 states and 211168 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81)